The multi-layered network design problem

DOI10.1016/j.ejor.2006.07.046zbMath1129.90046OpenAlexW2059249089MaRDI QIDQ2370332

Benoit Lardeux, Arnaud Knippel

Publication date: 25 June 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.046

zbMATH Keywords

combinatorial optimizationnetwork design

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Benders decomposition approach for the robust network design problem with flow bifurcations ⋮ A taxonomy of multilayer network design and a survey of transportation and telecommunication applications ⋮ Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator ⋮ Solving survivable two-layer network design problems by metric inequalities ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut ⋮ Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems ⋮ An improved Benders decomposition applied to a multi-layer network design problem ⋮ OR for entrepreneurial ecosystems: a problem-oriented review and agenda

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Ancestor tree for arbitrary multi-terminal cut functions
• 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
• Discrete cost multicommodity network optimization problems and exact solution methods
• An Application of Generalized Linear Programming to Network Flows
• An Efficient Heuristic Procedure for Partitioning Graphs
• Modeling and Solving the Two-Facility Capacitated Network Loading Problem
• Network Design Using Cut Inequalities
• Routing Through Virtual Paths in Layered Telecommunication Networks
• Capacitated Network Design—Polyhedral Structure and Computation
• Geometry of cuts and metrics