AN IMPROVED IMPLICIT ENUMERATION APPROACH FOR INTEGER PROGRAMMING

Abstract

The report presents a synthesis of the Balasian implicit enumeration approach to integer linear programming with the approach typified by Land and Doig and by Roy, Bertier, and Nghiem. This synthesis results from the use of an imbedded linear program to compute surrogate constraints that are as 'strong' as possible in a sense slightly different from that originally used by Glover. A very simple implicit enumeration algorithm fitted with optional imbedded linear programming machinery was implemented and tested extensively on an IBM 7044 computer. Use of the imbedded linear program dramatically reduced solution time in virtually every case and sufficied to render the tested algorithm superior to the other five implicit enumeration algorithms for which comparable published experience was available. Existing evidence suggests that the present approach should permit the routine solution of practical integer problems involving hundreds of variables.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1968
Accession Number
AD0672255

Entities

People

  • A. M. Geoffrion

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programming
  • Corporations
  • Coverings
  • Heuristic Methods
  • Integer Programming
  • Iterations
  • Linear Programming
  • Mathematical Programming
  • Sequences
  • Simplex Method
  • Time Dependence
  • United States

Readers

  • Operations Research
  • Regression Analysis.