An Algorithm for the Bounded Variable Integer Programming Problem.

Abstract

TSR-1355DA-31-124-ARO(D)-462*Mathematical programming, Linear programming, Computer programming, Computations, Algorithms*Integer programmingAn algorithm is proposed for the bounded variable pure integer programming problem which treats general integer variables directly in an implicit enumeration procedure closely related to that advanced by Balas and Geoffrion for binary programming problems. Means of obtaining near optimum solutions through a slight modification of the algorithm are discussed. Techniques which use bounds on variables to improve algorithmic efficiency are developed and examined computationally. Further computational results indicate that direct treatment of general integer variables is significantly more effective than binary expansion. (Author)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1973
Accession Number
AD0774199

Entities

People

  • C. M. Shetty
  • L. E. Trotter Jr.

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Linear Programming
  • Mathematical Programming

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Graph Algorithms and Convex Optimization.
  • Parallel and Distributed Computing.