The convex hull of two core capacitated network design problems
Mathematical Programming: Series A and B
Computational experience with a difficult mixed-integer multicommodity flow problem
Mathematical Programming: Series A and B
Source sink flows with capacity installation in batches
Discrete Applied Mathematics
Minimum cost capacity installation for multicommodity network flows
Mathematical Programming: Series A and B - Special issue on computational integer programming
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Network Design Using Cut Inequalities
SIAM Journal on Optimization
SIAM Journal on Optimization
Tabu Search for a Network Loading Problem with Multiple Facilities
Journal of Heuristics
Row and column generation technique for a multistage cutting stock problem
Computers and Operations Research
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Models and Methods for Merge-in-Transit Operations
Transportation Science
Railroad Blocking: A Network Design Application
Operations Research
A Simplex-Based Tabu Search Method for Capacitated Network Design
INFORMS Journal on Computing
Design of Capacitated Multicommodity Networks with Multiple Facilities
Operations Research
Multicommodity network design with discrete node costs
Networks - Special Issue on Multicommodity Flows and Network Design
Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
Operations Research
Benders, metric and cutset inequalities for multicommodity capacitated network design
Computational Optimization and Applications
Relax-and-cut for capacitated network design
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
Models for representing piecewise linear cost functions
Operations Research Letters
Integration of equipment constraints in the network topology design process
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
A heuristic algorithm for a prize-collecting local access network design problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Projected Perspective Reformulations with Applications in Design Problems
Operations Research
Efficient metaheuristics to solve the intermodal terminal location problem
Computers and Operations Research
Transforming mathematical models using declarative reformulation rules
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.04 |
We study 0-1 reformulations of the multicommodity capacitated network design problem, which is usually modeled with general integer variables to represent design decisions on the number of facilities to install on each arc of the network. The reformulations are based on the multiple choice model, a generic approach to represent piecewise linear costs using 0-1 variables. This model is improved by the addition of extended linking inequalities, derived from variable disaggregation techniques. We show that these extended linking inequalities for the 0-1 model are equivalent to the residual capacity inequalities, a class of valid inequalities derived for the model with general integer variables. In this paper, we compare two cutting-plane algorithms to compute the same lower bound on the optimal value of the problem: one based on the generation of residual capacity inequalities within the model with general integer variables, and the other based on the addition of extended linking inequalities to the 0-1 reformulation. To further improve the computational results of the latter approach, we develop a column-and-row generation approach; the resulting algorithm is shown to be competitive with the approach relying on residual capacity inequalities.