Volume 20, Number 1 (7-2001)                   jame 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. jame. 2001; 20 (1) :127-135
URL: http://jame.iut.ac.ir/article-1-217-en.html

Abstract:   (1583 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]   (378 Downloads)    
Type of Study: Research | Subject: General
Received: 2014/10/25

Add your comments about this article : Your username or email:
Write the security code in the box

© 2015 All Rights Reserved | Journal of Advanced Materials in Engineering (Esteghlal)

Designed & Developed by : Yektaweb

تحت نظارت وف بومی آسپا-وف