Speed-up Benders decomposition using maximum density cut (MDC) generation

DOI10.1007/s10479-012-1237-8zbMath1284.90043OpenAlexW2058960752MaRDI QIDQ2442077

Marianthi Ierapetritou, Georges K. Saharidis

Publication date: 31 March 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1237-8

zbMATH Keywords

active constraintsmixed integer linear programmingbenders decompositioncovering cut bundle generation (CCB)multi-generation of cuts

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem ⋮ On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Accelerating Benders decomposition: multiple cuts via multiple solutions ⋮ Benders decomposition for the mixed no-idle permutation flowshop scheduling problem ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines ⋮ The Benders decomposition algorithm: a literature review ⋮ An accelerated L-shaped method for solving two-stage stochastic programs in disaster management ⋮ Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion ⋮ Acceleration strategies of Benders decomposition for the security constraints power system expansion planning

Cites Work

• Unnamed Item
• An active set strategy for solving optimization problems with up to 200,000,000 nonlinear constraints
• Large-scale mixed integer programming: Benders-type heuristics
• An integrated model for logistics network design
• Active constraint set invariancy sensitivity analysis in linear optimization
• Partitioning procedures for solving mixed-variables programming problems
• Exact solution of multicommodity network optimization problems with general step cost functions
• On using approximations of the Benders master problem
• Discrete cost multicommodity network optimization problems and exact solution methods
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• A Benders Decomposition Approach for the Locomotive and Car Assignment Problem
• Accelerating Benders Decomposition by Local Branching
• Accelerating Benders method using covering cut bundle generation
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• Inexact Cuts in Benders Decomposition
• Cross decomposition for mixed integer programming
• Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network