A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem

Bahram Alidaee () and Gary A. Kochenberger ()
Additional contact information
Bahram Alidaee: Hearin Center for Enterprise Science, School of Business, University of Mississippi, University, Mississippi 38677
Gary A. Kochenberger: Business School, University of Colorado at Denver, Denver, Colorado 80217

Transportation Science, 2005, vol. 39, issue 1, 140-143

Abstract: The single-sink, fixed-charge transportation problem has a variety of applications, including supplier selection, product distribution/fleet selection, and process selection. In this paper we present a dynamic programming algorithm for solving this important problem that is very easy to implement and that improves considerably in terms of computational attractiveness on the best methods in the literature.

Keywords: fixed-charge transportation problem; dynamic programming; optimization (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1030.0055 (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:ortrsc:v:39:y:2005:i:1:p:140-143

Access Statistics for this article

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