Generating Benders cuts for a general class of integer programming problems
From MaRDI portal
Recommendations
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Large-scale mixed integer programming: Benders-type heuristics
- On generating maximal nondominated Benders cuts
- The Benders dual decomposition method
Cited in
(25)- Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
- The multiple multidimensional knapsack with family-split penalties
- Multi-warehouse package consolidation for split orders in online retailing
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- Exact optimization and decomposition approaches for shelf space allocation
- A robust disaster preparedness model for effective and fair disaster response
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs
- Petroleum supply planning: reformulations and a novel decomposition algorithm
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- On generating maximal nondominated Benders cuts
- Single-facility scheduling by logic-based Benders decomposition
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Accelerating Benders method using covering cut bundle generation
- Collaborative operating room planning and scheduling
- Two heuristic methods based on decomposition to the integrated multi-agent supply chain scheduling and distribution problem
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
- Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems
- A Benders approach to the minimum chordal completion problem
- Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut
- A decomposition approach for multidimensional knapsacks with family‐split penalties
- A stable matching model for long-term carpooling
- A distributionally robust optimization model for inventory-transportation integrated optimization problem of petroleum products under uncertainty
- Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming
- Large-scale mixed integer programming: Benders-type heuristics
- An integrated method for planning and scheduling to minimize tardiness
This page was built for publication: Generating Benders cuts for a general class of integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713901)
