Implementing Automatic Benders Decomposition in a Modern MIP Solver
From MaRDI portal
Publication:5041736
DOI10.1007/978-3-030-45771-6_7zbMath1503.90082OpenAlexW3016297128MaRDI QIDQ5041736
Andrea Tramontani, Pierre Bonami, Domenico Salvagnin
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_7
Related Items
Benders decomposition for a node-capacitated virtual network function placement and routing problem, Benders decomposition for a period-aggregated resource leveling problem with variable job duration, A Benders decomposition algorithm for demand-driven metro scheduling, The stochastic pseudo-star degree centrality problem, The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs, Two extended formulations for the virtual network function placement and routing problem, Risk‐averse two‐stage stochastic programming for the inventory rebalancing of bike‐sharing systems, Accelerating Benders decomposition for short-term hydropower maintenance scheduling, Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems
Uses Software
Cites Work
- Decomposition algorithms for two-stage chance-constrained programs
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
- On the separation of disjunctive cuts
- Lift-and-project for mixed 0-1 programming: recent progress
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- A modified lift-and-project procedure
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- The Benders decomposition algorithm: a literature review
- Models and algorithms for the product pricing with single-minded customers requesting bundles
- ``Facet separation with one linear program
- A note on the selection of Benders' cuts
- A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
- Minimizing a stochastic maximum-reliability path
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Valid inequalities for problems with additive variable upper bounds
