Elementary Closures for Integer Programs

Abstract

In integer programming, the elementary closure associated with a family of cuts is the convex set defined by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two versions of intersection cuts and their strengthened forms, Chvatal cuts, MIR cuts, lift-and-project cuts without and with strengthening, two versions of disjunctive cuts, Sherali-Adams cuts and Lovasz-Schrijver cuts with positive semi-definiteness constraints.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 2000
Accession Number
AD1021098

Entities

People

  • Gérard Cornuéjols
  • Yanjun Li

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Convex Sets
  • Equations
  • Inclusions
  • Inequalities
  • Integer Programming
  • Integrals
  • Linear Programming
  • Literature
  • Nonlinear Systems
  • Optimization
  • Polynomials
  • Theorems

Readers

  • Operations Research