An interior-point Benders based branch-and-cut algorithm for mixed integer programs

DOI10.1007/s10479-010-0806-yzbMath1284.90042OpenAlexW2015067034MaRDI QIDQ2442074

Joe Naoum-Sawaya, Samir Elhedhli

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-010-0806-y

zbMATH Keywords

branch-and-boundbranch-and-cutBenders decompositionanalytic center cutting plane method

Mathematics Subject Classification ID

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

Related Items (22)

Learning Optimized Risk Scores ⋮ A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Benders decomposition without separability: a computational study for capacitated facility location problems ⋮ A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ A branch-and-check approach for a wind turbine maintenance scheduling problem ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ A Benders decomposition algorithm for demand-driven metro scheduling ⋮ A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion ⋮ Accelerating Benders decomposition: multiple cuts via multiple solutions ⋮ An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming ⋮ The Benders Dual Decomposition Method ⋮ The rank pricing problem with ties ⋮ The Benders decomposition algorithm: a literature review ⋮ Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Benders decomposition: solving binary master problems by enumeration ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ An accelerated L-shaped method for solving two-stage stochastic programs in disaster management ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ Design and implementation of a modular interior-point solver for linear optimization

Cites Work

• Unnamed Item
• Large-scale mixed integer programming: Benders-type heuristics
• Partitioning procedures for solving mixed-variables programming problems
• Solving combinatorial optimization problems using Karmarkar's algorithm
• Warm start of the primal-dual method applied in the cutting-plane scheme
• A survey on Benders decomposition applied to fixed-charge network design problems
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• A cutting plane method from analytic centers for stochastic programming
• Complexity estimates of some cutting plane methods based on the analytic barrier
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• Generalized Benders decomposition
• A note on the selection of Benders' cuts
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Accelerating Benders Decomposition by Local Branching
• The Cutting-Plane Method for Solving Convex Programs
• Accelerating Benders method using covering cut bundle generation
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• Multicommodity Distribution System Design by Benders Decomposition
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• On constrained optimization by adjoint based quasi-Newton methods
• Computational Experience with an Interior Point Cutting Plane Algorithm
• Exact solution of the centralized network design problem on directed graphs
• Location of the Maximum on Unimodal Surfaces
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

This page was built for publication: An interior-point Benders based branch-and-cut algorithm for mixed integer programs