Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

Abstract

We investigate the computational issues that need to be addressed when incorporating general cutting planes for mixed 0-1 programs into a branch- and-cut framework. The cuts we use are of the lift-and-project variety. Some of the issues addressed have a theoretical answer but others are of an experimental nature and axe settled by comparing alternatives on a set of test problems. The resulting code is a robust solver for mixed 0-1 programs. We compare it with several existing codes.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 25, 1994
Accession Number
ADA278045

Entities

People

  • Egon Balas
  • Gérard Cornuéjols
  • Sebastian Ceria

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Automatic
  • Computer Programming
  • Convex Sets
  • Demographic Cohorts
  • Inequalities
  • Integer Programming
  • Linear Programming
  • Linear Systems
  • Literature
  • New York
  • Optimization
  • Plastic Explosives
  • Simplex Method
  • Test Beds
  • Theorems
  • Universities

Readers

  • Operations Research
  • Systems Analysis and Design