A Bound-and-Scan Algorithm for Pure Integer Linear Programming with General Variables

Frederick S. Hillier
Additional contact information
Frederick S. Hillier: Stanford University, Stanford, California

Operations Research, 1969, vol. 17, issue 4, 638-679

Abstract: A new algorithm for solving the pure-integer linear programming problem with general integer variables is presented and evaluated. Roughly speaking, this algorithm proceeds by obtaining tight bounds or conditional bounds on the relevant values of the respective variables, and then identifying a sequence of constantly improving feasible solutions by scanning the relevant solutions. Encouraging computational experience is reported that suggests that this algorithm should compare favorably in efficiency with existing algorithms. Plans for investigating ways of further increasing the efficiency of the algorithm and of extending it to more general problems also are outlined.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.4.638 (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:17:y:1969:i:4:p:638-679

Access Statistics for this article

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