A FLEXIBLE TREE SEARCH METHOD FOR INTEGER PROGRAMMING PROBLEMS,

Abstract

The paper presents an enumerative method for solving integer programming problems and an algorithm implementing this method. Whereas the enumerative methods so far available closely follow the pattern used in counting numbers, underlying the proposed method is a more flexible scheme. In the former case, numbers are enumerated by modifying the digits from the rightmost, leftward. In the latter, the choice of a digit to be modified is allowed a greater degree of freedom: the technique amounts to reshuffling, at each stage, the ranks of the digits in a certain set. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 05, 1969
Accession Number
AD0697317

Entities

People

  • Ph. Tuan Nghiem

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Mathematics

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Operations Research