Solving Integer Programs With Enumeration Cutting Planes

Abstract

A cutting plane technique with applicability to the solution of general integer programs is presented and the computational value of this technique is demonstrated by applying it to a collection of seven difficult integer programs arising from real-world applications. Four of the seven problems are solved to optimality without the aid of branch and bound, and six of the seven problems have the gap between the value of the integer program and its linear programming relaxation closed by over 98%.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1992
Accession Number
ADA453863

Entities

People

  • E. A. Boyd

Organizations

  • Rice University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Availability
  • Classification
  • Computer Programming
  • Contracts
  • Information Operations
  • Instructions
  • Linear Programming
  • Mathematics
  • Monitoring
  • Operations Research
  • Security
  • Standards
  • Universities

Readers

  • Operations Research