Accelerating Benders decomposition with heuristic master problem solutions

DOI10.1590/S0101-74382012005000005zbMATH Open1255.90083MaRDI QIDQ4904321FDOQ4904321

Alysson M. Costa, Jean-François Cordeau, Bernard Gendron, G. Laporte

Publication date: 28 January 2013

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000100002&lng=en&nrm=iso&tlng=en

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

zbMATH Keywords

mixed-integer programmingBenders decompositionextra cuts generation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Cites Work

• Practical enhancements to the Magnanti-Wong method
• Partitioning procedures for solving mixed-variables programming problems
• Accelerating Benders decomposition by local branching
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Tabu Search—Part I
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Variable neighborhood search
• Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm
• Tabu Search—Part II
• A survey on Benders decomposition applied to fixed-charge network design problems
• Title not available (Why is that?)
• Benders, metric and cutset inequalities for multicommodity capacitated network design
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
• A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
• A tabu search with slope scaling for the multicommodity capacitated location problem with balancing requirements
• When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings

Cited In (17)

• Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
• An L-shaped method with strengthened lift-and-project cuts
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
• Title not available (Why is that?)
• Meta partial Benders decomposition for the logistics service network design problem
• The Benders decomposition algorithm: a literature review
• Benders' decomposition for the balancing of assembly lines with stochastic demand
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
• A Benders decomposition-based approach for logistics service network design
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
• Benders decomposition: solving binary master problems by enumeration
• Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
• A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm

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)