Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
DOI10.1016/J.DISOPT.2019.100555zbMATH Open1506.90068OpenAlexW2980363502WikidataQ126997966 ScholiaQ126997966MaRDI QIDQ2299984FDOQ2299984
Authors: Amal Benhamiche, Nancy Perrot, Eduardo Uchoa, A. R. Mahjoub 
Publication date: 24 February 2020
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2019.100555
Recommendations
- A polyhedral study of the capacity formulation of the multilayer network design problem
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- The two layer network design problem
- The multi-layered network design problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)
Cites Work
- Title not available (Why is that?)
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- On the facial structure of set packing polyhedra
- A new approach to the maximum-flow problem
- Branch and price for WDM optical networks with no bifurcation of flow
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Minimum cost capacity installation for multicommodity network flows
- On capacitated network design cut-set polyhedra
- On cut-based inequalities for capacitated network design polyhedra
- Network Design Using Cut Inequalities
- Capacitated Network Design—Polyhedral Structure and Computation
- Metric inequalities and the network loading problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Facets of the balanced (acyclic) induced subgraph polytope
- Unsplittable non-additive capacitated network design using set functions polyhedra
- A polyhedral study of the capacity formulation of the multilayer network design problem
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- The multi-layered network design problem
- Design of survivable IP-over-optical networks
- Clique-based facets for the precedence constrained knapsack problem
- Source sink flows with capacity installation in batches
- Network design arc set with variable upper bounds
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Multi-layer MPLS network design: The impact of statistical multiplexing
Cited In (7)
- A polyhedral analysis of the capacitated edge activation problem with uncertain demands
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
- A polyhedral study of the capacity formulation of the multilayer network design problem
- A characterization of the uncapacitated network design polytope
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- The two layer network design problem
This page was built for publication: Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299984)
