A primal‐dual cutting‐plane algorithm for all‐integer programming

Parviz Ghandforoush and Larry M. Austin

Naval Research Logistics Quarterly, 1981, vol. 28, issue 4, 559-566

Abstract: The integer programming literature contains many algorithms for solving all‐integer programming problems but, in general, existing algorithms are less than satisfactory even in solving problems of modest size. In this paper we present a new technique for solving the all‐integer, integer programming problem. This algorithm is a hybrid (i.e., primal‐dual) cutting‐plane method which alternates between a primal‐feasible stage related to Young's simplified primal algorithm, and a dual‐infeasible stage related to Gomory's dual all‐integer algorithm. We present the results of computational testing.

Date: 1981
References: Add references at CitEc
Citations:

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

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:28:y:1981:i:4:p:559-566

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 ().