A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
From MaRDI portal
Publication:5058020
DOI10.1287/ijoc.2022.1207OpenAlexW4283016545MaRDI QIDQ5058020
Sungsoo Park, Seulgi Joung, Kiho Seo, Chungmok Lee
Publication date: 1 December 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1207
fractional programming problemPareto-optimal cutBenders decomposition algorithmoptimality cutmulticommodity capacitated fixed-charge network design problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints
- The Benders decomposition algorithm: a literature review
- A survey on Benders decomposition applied to fixed-charge network design problems
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- ``Facet separation with one linear program
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- Generalized Benders decomposition
- A note on the selection of Benders' cuts
- Accelerating Benders Decomposition by Local Branching
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Benders Decomposition for Production Routing Under Demand Uncertainty
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- Benders decomposition approach for the robust network design problem with flow bifurcations
- Integer Programming: Methods, Uses, Computations
- On Nonlinear Fractional Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Valid inequalities for problems with additive variable upper bounds
- Benchmarking optimization software with performance profiles.
