Network Optimization with Concave Costs
نویسنده
چکیده مقاله:
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.
منابع مشابه
network optimization with piecewise linear convex costs
the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...
متن کاملThe Virtual Private Network Design Problem with Concave Costs
The symmetric Virtual Private Network Design (VPND) problem is concerned with buying capacity on links (edges) in a communication network such that certain traffic demands can be met. The precise definition is below. It was shown by Fingerhut, Suri and Turner [3] and later, independently, by Gupta, Kleinberg, Kumar, Rastogi and Yener [8] that VPND can be solved in polynomial time if it has the ...
متن کاملExperiments on Virtual Private Network Design with Concave Capacity Costs
For the first time in the literature, the paper considers computational aspects of concave cost virtual private network design problems. It introduces careful bound tightening mechanisms and computationally demonstrate how such bound tightening could impressively improve convex relaxations of the problem. It turns out that, incorporating such bound tightening with a general solution approach co...
متن کاملSupply Chain Network Design with Concave Costs: Theory and Applications
Many practical decision models can be formulated as concave minimization problems. Supply chain network design problems (SCNDP) that explicitly account for economies-ofscale and/or risk pooling often lead to mathematical problems with a concave objective and linear constraints. In this thesis, we propose new solution approaches for this class of problems and use them to tackle new applications....
متن کاملNetwork Optimization with Piecewise Linear Convex Costs
The problem of finding the minimum cost multi-commodity flow in an undirected and complete network is studied when the link costs are piecewise linear and convex. The arc-path model and overflow model are presented to formulate the problem. The results suggest that the new overflow model outperforms the classical arc-path model for this problem. The classical revised simplex, Frank and Wolf and...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 20 شماره 1
صفحات 127- 135
تاریخ انتشار 2001-07
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023