Volume 20, Issue 1 (7-2001)
2001, 20(1): 127-135 |
Back to browse issues page
Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
S. Ketabi. Network Optimization with Concave Costs. Computational Methods in Engineering 2001; 20 (1) :127-135
URL: http://jcme.iut.ac.ir/article-1-217-en.html
URL: http://jcme.iut.ac.ir/article-1-217-en.html
Abstract: (4562 Views)
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
