Showing 1 results for S. Ketabi
S. Ketabi,
Volume 20, Issue 1 (7-2001)
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.
