Accelerating benders decomposition with heuristicmaster problem solutions

DOI10.1590/S0101-74382012005000005zbMath1255.90083MaRDI QIDQ4904321

Alysson M. Costa, Jean-François Cordeau, Bernard Gendron, Gilbert 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

zbMATH Keywords

Benders decompositionmixed-integer programmingextra cuts generation

Mathematics Subject Classification ID

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

Related Items (13)

The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ A mixed-integer programming approach for locating jamming devices in a flow-jamming attack ⋮ An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ A Benders decomposition-based approach for logistics service network design ⋮ Benders decomposition for the mixed no-idle permutation flowshop scheduling problem ⋮ The Benders decomposition algorithm: a literature review ⋮ Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design ⋮ Benders' decomposition for the balancing of assembly lines with stochastic demand ⋮ Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design ⋮ 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 L-shaped method with strengthened lift-and-project cuts ⋮ Meta partial Benders decomposition for the logistics service network design problem

Cites Work

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

This page was built for publication: Accelerating benders decomposition with heuristicmaster problem solutions