A partitioning algorithm for the network loading problem
From MaRDI portal
Publication:2654332
DOI10.1016/j.ejor.2009.10.009zbMath1178.90050MaRDI QIDQ2654332
Jean-Philippe Vial, Frédéric Babonneau
Publication date: 15 January 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://www.uclouvain.be/cps/ucl/doc/core/documents/coredp2007_91.pdf
90C35: Programming involving graphs or networks
90C11: Mixed integer programming
90B10: Deterministic network models in operations research
Cites Work
- A note on two problems in connexion with graphs
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Source sink flows with capacity installation in batches
- Partitioning procedures for solving mixed-variables programming problems
- Minimum cost capacity installation for multicommodity network flows
- Metric inequalities and the network loading problem
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Capacitated Network Design—Polyhedral Structure and Computation