Implementing automatic benders decomposition in a modern MIP solver

DOI10.1007/978-3-030-45771-6_7MaRDI QIDQ5041736zbMATH OpenOpenAlexFDO

Authors Pierre Bonami, Domenico Salvagnin, Andrea Tramontani

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

zbMATH Keywords

generalized bound constraintsnumerically robust method

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• The Benders dual decomposition method
• Benders decomposition: solving binary master problems by enumeration
• Accelerating Benders decomposition by local branching
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Integrating Benders Decomposition Within Constraint Programming

Cites work

• ``Facet separation with one linear program
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A modified lift-and-project procedure
• A note on the selection of Benders' cuts
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Benders decomposition for very large scale partial set covering and maximal covering location problems
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Decomposition algorithms for two-stage chance-constrained programs
• Lift-and-project for mixed 0-1 programming: recent progress
• Minimizing a stochastic maximum-reliability path
• Models and algorithms for the product pricing with single-minded customers requesting bundles
• Multicommodity Distribution System Design by Benders Decomposition
• On the separation of disjunctive cuts
• Partitioning procedures for solving mixed-variables programming problems
• Practical enhancements to the Magnanti-Wong method
• Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design
• Strengthened benders cuts for stochastic integer programs with continuous recourse
• The Benders decomposition algorithm: a literature review
• Valid inequalities for problems with additive variable upper bounds

Cited in

(25)

• Accelerating Benders decomposition for short-term hydropower maintenance scheduling
• Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
• Mixed-integer linear programming models and algorithms for generation and transmission expansion planning of power systems
• Speed-up Benders decomposition using maximum density cut (MDC) generation
• 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
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• The Benders dual decomposition method
• Integer Programming and Combinatorial Optimization
• 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
• Supplier selection under disruption risk with hybrid procurement
• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
• Models and algorithms for the time window assignment traveling salesperson problem with stochastic travel times
• Benders decomposition for a reverse logistics network design problem in the dairy industry
• Benders decomposition for the large-scale probabilistic set covering problem
• Last fifty years of integer linear programming: a focus on recent practical advances
• Benders decomposition for the discrete ordered median problem
• A fix-propagate-repair heuristic for mixed integer programming
• An effective hybrid decomposition approach to solve the network-constrained stochastic unit commitment problem in large-scale power systems
• A novel Pareto-optimal cut selection strategy for Benders decomposition
• Freight-on-transit operational problems with robot delivery: genetic algorithm and Benders decomposition approaches

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Implementing automatic benders decomposition in a modern MIP solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041736)