A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem

Jeff Kennington and Ed Unger
Additional contact information
Jeff Kennington: Southern Methodist University
Ed Unger: Georgia Institute of Technology

Management Science, 1976, vol. 22, issue 10, 1116-1126

Abstract: A new branch-and-bound procedure specialized for the fixed-charge transportation problem has been developed. The technique strongly exploits the underlying transportation structure. The relaxed problem assumes this form and simple penalties are easily constructed from the optimal solution of this transportation problem. These penalties are used in the standard branch-and-bound tasks of fathoming and guiding separation. The procedure has been coded, and over sixty test problems have been solved.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.22.10.1116 (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:ormnsc:v:22:y:1976:i:10:p:1116-1126

Access Statistics for this article

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