A note comparing glover's and young's simplified primal algorithms

Harvey M. Salkin

Naval Research Logistics Quarterly, 1972, vol. 19, issue 2, 399-402

Abstract: Glover and Young, References [4] and [8], respectively, present convergent primal integer programming algorithms. The algorithm outlined in Young's paper (which was deliberately specialized) is shown to be a special case of the Glover algorithm under his acceptable source row selection, Rule 1.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800190214

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:wly:navlog:v:19:y:1972:i:2:p:399-402

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().