Accelerating Benders decomposition with heuristic master problem solutions
From MaRDI portal
Publication:4904321
Recommendations
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- Accelerating Benders decomposition by local branching
- Benders decomposition: solving binary master problems by enumeration
- On generating maximal nondominated Benders cuts
- Accelerating Benders method using covering cut bundle generation
Cites work
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- A survey on Benders decomposition applied to fixed-charge network design problems
- A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Accelerating Benders decomposition by local branching
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- Fault-tolerant facility location: a randomized dependent LP-rounding algorithm
- Partitioning procedures for solving mixed-variables programming problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- Practical enhancements to the Magnanti-Wong method
- Tabu Search—Part I
- Tabu Search—Part II
- Variable neighborhood search
- When LP is the cure for your matching woes: improved bounds for stochastic matchings (extended abstract)
Cited in
(25)- Improving Benders decomposition using a genetic algorithm
- Accelerating Benders decomposition: multiple cuts via multiple solutions
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- Accelerating Benders decomposition by local branching
- On generating maximal nondominated Benders cuts
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Meta partial Benders decomposition for the logistics service network design problem
- scientific article; zbMATH DE number 4008102 (Why is no real title available?)
- The Benders decomposition algorithm: a literature review
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
- Benders' decomposition for the balancing of assembly lines with stochastic demand
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- An L-shaped method with strengthened lift-and-project cuts
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
- Practical enhancements to the Magnanti-Wong method
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- Benders decomposition: solving binary master problems by enumeration
- A Benders decomposition-based approach for logistics service network design
This page was built for publication: Accelerating Benders decomposition with heuristic master problem solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904321)
