General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

Authors:
Alexander Martin
Affiliations:
-
Venue:
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Year:
2000

Citing 12
Cited 2

A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
Presolving in linear programming

Mathematical Programming: Series A and B
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
Cutting planes for integer programs with general integer variables

Mathematical Programming: Series A and B - Special issue on computational integer programming
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Solving Multiple Knapsack Problems by Cutting Planes

SIAM Journal on Optimization
Decomposing Matrices into Blocks

SIAM Journal on Optimization
Lifted Cover Inequalities for 0-1 Integer Programs: Computation

INFORMS Journal on Computing
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity

INFORMS Journal on Computing
Finding Cuts in the TSP (A preliminary report)

Finding Cuts in the TSP (A preliminary report)
The complexity of cover inequality separation11This research was supported by US Army Research Office DAAH04-94-G-0017 and NSF Grant No. DMI-9700285.

Operations Research Letters
Gomory cuts revisited

Operations Research Letters

The Optimal Diversity Management Problem

Operations Research
Complexity evaluation of benchmark instances for the p-median problem

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on preprocessing techniques, branch-and-bound issues and cutting plane generation.