An improved Benders decomposition applied to a multi-layer network design problem
From MaRDI portal
Publication:1038109
DOI10.1016/j.orl.2009.05.007zbMath1279.90025OpenAlexW2001547927MaRDI QIDQ1038109
Publication date: 17 November 2009
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2009.05.007
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)
Related Items (40)
Exact approaches to the single-source network loading problem ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ Branch-and-cut methods for the network design problem with vulnerability constraints ⋮ Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain ⋮ On the hop-constrained survivable network design problem with reliable edges ⋮ Unsplittable non-additive capacitated network design using set functions polyhedra ⋮ Network loading problem: valid inequalities from 5- and higher partitions ⋮ A polyhedral study of the capacity formulation of the multilayer network design problem ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks ⋮ The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach ⋮ Benders decomposition for network design covering problems ⋮ A taxonomy of multilayer network design and a survey of transportation and telecommunication applications ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ A branch‐and‐cut algorithm for hub network design problems with profits ⋮ Telecommunications network design: Technology impacts and future directions ⋮ Separating tight metric inequalities by bilevel programming ⋮ Fixed charge multicommodity network design using \(p\)-partition facets ⋮ A survivable variant of the ring star problem ⋮ Solution of preemptive multi-objective network design problems applying Benders decomposition method ⋮ A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation ⋮ The Benders decomposition algorithm: a literature review ⋮ Scheduling medical residents' training at university hospitals ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Benders decomposition: solving binary master problems by enumeration ⋮ Accelerating Benders decomposition for short-term hydropower maintenance scheduling ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion ⋮ Formulations and decomposition methods for the incomplete hub location network design problem with and without hop-constraints ⋮ 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 ⋮ Benders Decomposition for Capacitated Network Design ⋮ Combining Dantzig-Wolfe and Benders decompositions to solve a large-scale nuclear outage planning problem
Uses Software
Cites Work
- Unnamed Item
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- Exact solution of multicommodity network optimization problems with general step cost functions
- A survey on Benders decomposition applied to fixed-charge network design problems
- The multi-layered network design problem
- Metric inequalities and the network loading problem
- Multiperiod network design with incremental routing
- Routing Through Virtual Paths in Layered Telecommunication Networks
- Geometry of cuts and metrics
This page was built for publication: An improved Benders decomposition applied to a multi-layer network design problem
