Author

• S. Ketabi

Abstract

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

Keywords

• Network flow
• Piecewise linear concave function
• link-path model
• random search methods
• lagrangian relaxation method
• subgradient method