Benders Decomposition for Capacitated Network Design
From MaRDI portal
Publication:2835663
DOI10.1007/978-3-319-45587-7_7zbMath1432.90026OpenAlexW2512955784MaRDI QIDQ2835663
Publication date: 30 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_7
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Energy-aware survivable networks
- Unsplittable non-additive capacitated network design using set functions polyhedra
- Solving survivable two-layer network design problems by metric inequalities
- The convex hull of two core capacitated network design problems
- Lower bounds and reduction procedures for the bin packing problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Minimum cost capacity installation for multicommodity network flows
- Separating tight metric inequalities by bilevel programming
- The robust network loading problem with dynamic routing
- Metric inequalities and the network loading problem
- Using mixed-integer programming to solve power grid blackout problems
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- The cut property under demand uncertainty
- Benders decomposition approach for the robust network design problem with flow bifurcations
- A polyhedral study of the capacity formulation of the multilayer network design problem
- k-Partition-based facets of the network design problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
This page was built for publication: Benders Decomposition for Capacitated Network Design