Some branch‐and‐bound procedures for fixed‐cost transportation problems

A. Victor Cabot and S. Selcuk Erenguc

Naval Research Logistics Quarterly, 1984, vol. 31, issue 1, 145-154

Abstract: In this article we present three properties that will improve the performance of branch‐and‐bound algorithms for fixed‐cost transportation problems. By applying Lagrangian relaxation we show that one can develop stronger up and down penalties than those traditionally used and also develop a strengthened penalty for nonbasic variables. We also show that it is possible to “look ahead” of a particular node and determine the solution at the next node without actually calculating it. We present computational evidence by comparing our developments with existing procedures.

Date: 1984
References: Add references at CitEc
Citations: View citations in EconPapers (3)

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

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:31:y:1984:i:1:p:145-154

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