Minimum cost capacity installation for multicommodity network flows
Mathematical Programming: Series A and B - Special issue on computational integer programming
Network Design Using Cut Inequalities
SIAM Journal on Optimization
Algorithms and Extended Formulations for One and Two Facility Network Design
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
Metaheuristics for optimization problems in computer communications
Computer Communications
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
Balancing throughput and delay performance by effective shortest path routing
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
QoS-based cooperative algorithm for integral multi-commodity flow problem
Computer Communications
Adaptive memory in multistart heuristics for multicommodity network design
Journal of Heuristics
| Hi-index | 0.00 |
In this paper, approximate solutions algorithms for discrete cost multicommodity network optimization problems are presented and compared. Firstly, extensions of classical greedy heuristics, based on link-rerouting and flow-rerouting heuristics, are presented in details. Secondly, a new approximate solution algorithm, which basically consists of a heuristic implementation of the exact Benders-type cutting plane generation method, is proposed. All these algorithms are extensively compared on randomly generated graphs up to 50 nodes and 90 links. It clearly appears that this new Benders-type approach is very promising since it produces the best heuristic solutions.