INTEGER PROGRAMMING BY IMPLICIT ENUMERATION AND BALAS' METHOD

Abstract

This memorandum presents a reformulation of the essentials of Balas' algorithm for the zero-one integer linear programming problem, and is based upon the idea of 'elementary tree search' that has also been used by Glover as the basis for his multiphase-dual algorithm. The present reformulation requires considerably less computer storage than the original version, and clarifies the rationale behind the algorithm, thereby leading naturally to variants and extensions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1966
Accession Number
AD0628361

Entities

People

  • Arthur M. Geoffrion

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Nonlinear Programming
  • Operations Research
  • Permutations
  • Sequences
  • United States

Readers

  • Operations Research
  • Systems Analysis and Design