Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition
From MaRDI portal
Publication:6081826
DOI10.1007/s43069-023-00242-3OpenAlexW4385900344MaRDI QIDQ6081826
Stephen J. Maher, Emil Karlsson, Aigerim Saken, Elina Rönnberg
Publication date: 5 October 2023
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-023-00242-3
optimality cutsBenders' cutslogic-based Benders' decompositioncut strengtheningfeasibility cutsirreducible cuts
Cites Work
- Unnamed Item
- Unnamed Item
- The one-machine sequencing problem
- Logic-based Benders decomposition
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- The Benders decomposition algorithm: a literature review
- Strengthening of feasibility cuts in logic-based benders decomposition
- Nutmeg: a MIP and CP hybrid solver using branch-and-check
- A branch-and-price-and-check model for the vehicle routing problem with location congestion
- Single-facility scheduling by logic-based Benders decomposition
- Generalized filtering algorithms for infeasibility analysis
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Detecting IIS in infeasible linear programmes using techniques from goal programming
- Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling
- Logic-Based Benders Decomposition for Large-Scale Optimization
- Planning and Scheduling by Logic-Based Benders Decomposition
- Locating Minimal Infeasible Constraint Sets in Linear Programs
- Multi-stage Benders Decomposition for Optimizing Multicore Architectures
- Principles and Practice of Constraint Programming – CP 2004
