A polyhedral approach to multicommodity survivable network design
From MaRDI portal
Publication:1338830
DOI10.1007/s002110050054zbMath0809.65068OpenAlexW2047900282MaRDI QIDQ1338830
Publication date: 28 March 1995
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050054
Related Items (23)
The multi-layered network design problem ⋮ Approximation algorithms for general one-warehouse multi-retailer systems ⋮ Design of survivable IP-over-optical networks ⋮ Design of survivable wireless backhaul networks with reliability considerations ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ Robust capacitated Steiner trees and networks with uniform demands ⋮ Benders, metric and cutset inequalities for multicommodity capacitated network design ⋮ Solving survivable two-layer network design problems by metric inequalities ⋮ Metric inequalities and the network loading problem ⋮ Adaptive memory in multistart heuristics for multicommodity network design ⋮ A survey on Benders decomposition applied to fixed-charge network design problems ⋮ A constraint generation algorithm for large scale linear programs using multiple-points separation ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Polyhedral structure of the 4-node network design problem ⋮ Towards optimizing the deployment of optical access networks ⋮ Optimal solution of the discrete cost multicommodity network design problem ⋮ Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ A primal partitioning approach for single and non-simultaneous multicommodity flow problems ⋮ Minimum cost capacity installation for multicommodity network flows ⋮ An exact approach for the multicommodity network optimization problem with a step cost function ⋮ Economic spare capacity planning for DCS mesh-restorable networks ⋮ Exact solution of multicommodity network optimization problems with general step cost functions
This page was built for publication: A polyhedral approach to multicommodity survivable network design
