A branch‐and‐bound algorithm for solving fixed charge problems

Patrick G. McKeown

Naval Research Logistics Quarterly, 1981, vol. 28, issue 4, 607-617

Abstract: Numerous procedures have been suggested for solving fixed charge problems. Among these are branch‐and‐bound methods, cutting plane methods, and vertex ranking methods. In all of these previous approaches, the procedure depends heavily on the continuous costs to terminate the search for the optimal solution. In this paper, we present a new branch‐and‐bound algorithm that calculates bounds separately on the sum of fixed costs and on the continuous objective value. Computational experience is shown for various standard test problems as well as for randomly generated problems. These test results are compared to previous procedures as well as to a mixed integer code. These comparisons appear promising.

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

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

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:607-617

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