Name
Abstract | ||
|---|---|---|
This paper provides new bounds related to the global optimization of the problem of mixed routing and bandwidth allocation in telecommunication systems. The combinatorial nature of the problem, related to arc expansion decisions, is embedded in a continuous objective function that encompasses congestion and investment line costs. It results in a non-convex multicommodity flow problem, but we explore the separability of the objective function and the fact that each associated arc cost function is piecewise-convex. Convexifying each arc cost function enables the use of efficient algorithms for convex multicommodity flow problems, and we show how to calculate sharp bounds for the approximated solutions. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S0167-6377(00)00027-4 | Oper. Res. Lett. |
Keywords | Field | DocType |
combinatorial nature,flow assignment problem,non-convex multicommodity flow problem,bandwidth allocation,objective function,approximated solution,separable convexification,network design,capacity expansion of telecommunication systems,continuous objective function,nonconvex multicommodity flow problem,investment line cost,global optimization,convex multicommodity flow problem,capacity expansion,arc cost function,associated arc cost function,cost function,multicommodity flow,assignment problem | Mathematical optimization,Arc (geometry),Global optimization,Network planning and design,Bandwidth allocation,Flow (psychology),Regular polygon,Multi-commodity flow problem,Minimum-cost flow problem,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 5 | Operations Research Letters |
Citations | PageRank | References |
8 | 0.79 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. P. L. Luna | 1 | 17 | 1.92 |
| Philippe Mahey | 2 | 174 | 20.95 |