An exact approach for the multicommodity network optimization problem with a step cost function

DOI10.1051/ro/2019017zbMath1425.90126OpenAlexW2915010603WikidataQ128545321 ScholiaQ128545321MaRDI QIDQ5244303

Imen Mejri, Mohamed Haouari, Farah Zeghal Mansour, Safa Bhar Layeb

Publication date: 20 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2019017

zbMATH Keywords

column generationnetworkscutset inequalitiesconstraint generation algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Uses Software

• SNDlib

Cites Work

• Unnamed Item
• Adaptive memory in multistart heuristics for multicommodity network design
• Minimum cost capacity installation for multicommodity network flows
• Exact solution of multicommodity network optimization problems with general step cost functions
• A polyhedral approach to multicommodity survivable network design
• LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions
• A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
• Discrete cost multicommodity network optimization problems and exact solution methods
• A survey on Benders decomposition applied to fixed-charge network design problems
• A branch-and-cut algorithm for capacitated network design problems
• Diversification strategies in local search for a nonbifurcated network loading problem
• Separating tight metric inequalities by bilevel programming
• Metric inequalities and the network loading problem
• Optimal solution of the discrete cost multicommodity network design problem
• Exact approaches to the single-source network loading problem
• On cut-based inequalities for capacitated network design polyhedra
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• Design of Capacitated Multicommodity Networks with Multiple Facilities
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• The complexity of the network design problem
• Benders decomposition approach for the robust network design problem with flow bifurcations
• Capacitated Network Design—Polyhedral Structure and Computation