Technical Note—A Flexible Tree-Search Method for Integer Programming Problems

Nghiem Ph. Tuan
Additional contact information
Nghiem Ph. Tuan: Purdue University, Lafayette, Indiana

Operations Research, 1971, vol. 19, issue 1, 115-119

Abstract: This paper presents an enumerative method for solving integer programming problems. In the enumerative methods so far available, the variables are ranked in a rigid order by the choices in the forward steps, and backtracking always takes place on the last variable in this order. The proposed method allows a greater flexibility in the backtracking step that makes it possible to devise suitable rules of choice to improve the efficiency of the searching process. A numerical example is devised to illustrate the enumerative method in the direct-search case.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.115 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:1:p:115-119

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().