Neural Benders decomposition for mixed-integer programming
From MaRDI portal
Cites work
- ``Facet separation with one linear program
- A Linear Programming Approach to the Cutting-Stock Problem
- A new warmstarting strategy for the primal-dual column generation method
- A note on the selection of Benders' cuts
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Branch-and-price: Column generation for solving huge integer programs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Dual inequalities for stabilized column generation revisited
- Dual-Optimal Inequalities for Stabilized Column Generation
- Generalized Benders decomposition
- Generalized Bundle Methods
- Incremental bundle methods using upper models
- Inexact Cuts in Benders Decomposition
- Interior point stabilization for column generation
- Large-scale optimization with the primal-dual column generation method
- Logic-based Benders decomposition
- New developments in the primal-dual column generation technique
- On generating maximal nondominated Benders cuts
- Partitioning procedures for solving mixed-variables programming problems
- Partitioning procedures for solving mixed-variables programming problems. Reprint
- Practical enhancements to the Magnanti-Wong method
- Selected Topics in Column Generation
- Stabilized column generation
- Strengthened benders cuts for stochastic integer programs with continuous recourse
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The Benders decomposition algorithm: a literature review
This page was built for publication: Neural Benders decomposition for mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913487)