Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
From MaRDI portal
Publication:2273684
DOI10.1016/j.cor.2019.07.007zbMath1458.90180OpenAlexW2962031742WikidataQ127469026 ScholiaQ127469026MaRDI QIDQ2273684
Carlos Armando Zetina, Jean-François Cordeau, Iván A. Contreras
Publication date: 25 September 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.07.007
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Related Items (8)
Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem ⋮ The transit time constrained fixed charge multi-commodity network design problem ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ A chance-constraint optimization model for a multi-echelon multi-product closed-loop supply chain considering brand diversity: an accelerated Benders decomposition algorithm ⋮ Directed fixed charge multicommodity network design: a cutting plane approach using polar duality ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem
Uses Software
Cites Work
- Unnamed Item
- Hybrid robust and stochastic optimization for closed-loop supply chain network design using accelerated Benders decomposition
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Lift-and-project for mixed 0-1 programming: recent progress
- Urban rapid transit network design: accelerated Benders decomposition
- An integrated model for logistics network design
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- Integrated airline scheduling
- Service network design with management and coordination of multiple fleets
- Practical enhancements to the Magnanti-Wong method
- Lagrangean relaxation for the capacitated hub location problem with single assignment
- An improved Benders decomposition applied to a multi-layer network design problem
- Partitioning procedures for solving mixed-variables programming problems
- Solving the optimal network problem
- Local branching
- Service network design in freight transportation
- A comparison of optimal methods for local access uncapacitated network design
- A Benders decomposition based framework for solving cable trench problems
- Branch-and-cut methods for the network design problem with vulnerability constraints
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- The Benders decomposition algorithm: a literature review
- Benders decomposition for the Hazmat transport network design problem
- A survey on Benders decomposition applied to fixed-charge network design problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Solving the optimum communication spanning tree problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- On optimizing over lift-and-project closures
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A stochastic programming approach for supply chain network design under uncertainty
- A note on the selection of Benders' cuts
- Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- Accelerating Benders Decomposition by Local Branching
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Tailoring Benders decomposition for uncapacitated network design
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Cyclic Scheduling via Integer Programs with Circular Ones
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The complexity of the network design problem
- Exact and approximate algorithms for optimal network design
- Disjunctive Programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Benchmarking optimization software with performance profiles.
This page was built for publication: Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
