AN IMPROVED IMPLICIT ENUMERATION APPROACH FOR INTEGER PROGRAMMING,

Abstract

The memorandum synthesizes the Balasian implicit enumeration approach to integer linear programming with the approach typified by Land and Doig and by Roy, Bertier and Nghiem. The 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. Use of the imbedded linear program dramatically reduced solution times in virtually every case, and sufficed to render the tested algorithm superior to the five other implicit enumeration algorithms for which comparable published experience was available. It would appear that the present approach permits the routine solution of practical integer programs involving hundreds of variables. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1968
Accession Number
AD0670735

Entities

People

  • A. M. Geoffrion

Organizations

  • University of California, Los Angeles

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research

Readers

  • Operations Research
  • Theoretical Analysis.