Volume 20, Issue 1 (7-2001)                   JCME 2001, 20(1): 127-135 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

S. Ketabi. Network Optimization with Concave Costs. JCME. 2001; 20 (1) :127-135
URL: http://jcme.iut.ac.ir/article-1-217-en.html
Abstract:   (3569 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.
Full-Text [PDF 192 kb]   (802 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25 | Published: 2001/07/15

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2022 CC BY-NC 4.0 | Computational Methods in Engineering

Designed & Developed by : Yektaweb