Accession Number : AD0697317

Title :   A FLEXIBLE TREE SEARCH METHOD FOR INTEGER PROGRAMMING PROBLEMS,

Corporate Author : PURDUE UNIV LAFAYETTE IND KRANNERT GRADUATE SCHOOL OF INDUSTRIAL ADMINISTRATION

Personal Author(s) : Nghiem,Ph. Tuan

Report Date : 05 SEP 1969

Pagination or Media Count : 29

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)

Descriptors :   (*MATHEMATICAL PROGRAMMING, SEARCH THEORY), ALGORITHMS, TOPOLOGY

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE