Surrogate duality in a branch‐and‐bound procedure

Mark H. Karwan and Ronald L. Rardin

Naval Research Logistics Quarterly, 1981, vol. 28, issue 1, 93-101

Abstract: Recent research has led to several surrogate multiplier search procedures for use in a primal branch‐and‐bound procedure. As single constrained integer programming problems, the surrogate subproblems are also solved via branch‐and‐bound. This paper develops the inner play between the surrogate subproblem and the primal branch‐and‐bound trees which can be exploited to produce a number of computational efficiencies. Most important is a restarting procedure which precludes the need to solve numerous surrogate subproblems at each node of a primal branch‐and‐bound tree. Empirical evidence suggests that this procedure greatly reduces total computation time.

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

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

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:1:p:93-101

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