The integration of an interior-point cutting plane method within a branch-and-price algorithm

DOI10.1007/s10107-003-0469-4zbMath1069.90109OpenAlexW2015024493MaRDI QIDQ1881560

Samir Elhedhli, Jean-Louis Goffin

Publication date: 5 October 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0469-4

zbMATH Keywords

Lagrangian relaxationcolumn generationinterior point methodsbranch-and-price

Mathematics Subject Classification ID

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

Related Items (18)

A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ Ranking lower bounds for the bin-packing problem ⋮ Improved branching disjunctions for branch-and-bound: an analytic center approach ⋮ Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem ⋮ Using the primal-dual interior point algorithm within the branch-price-and-cut method ⋮ A matrix generation approach for eigenvalue optimization ⋮ Operational Research: Milestones and Highlights of Canadian Contributions ⋮ An interior point cutting plane heuristic for mixed integer programming ⋮ An interior-point Benders based branch-and-cut algorithm for mixed integer programs ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Searching for optimal integer solutions to set partitioning problems using column generation ⋮ A semidefinite programming based polyhedral cut and price approach for the maxcut problem ⋮ Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing ⋮ Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension ⋮ Chebyshev center based column generation ⋮ Fast lifting procedures for the bin packing problem

Uses Software

• CPLEX
• LIPSOL

This page was built for publication: The integration of an interior-point cutting plane method within a branch-and-price algorithm