A transportation problem with a permuted demand vector

Steffen G. Meusel and Rainer E. Burkard

Mathematical Methods of Operations Research, 1999, vol. 50, issue 1, 7 pages

Abstract: This paper deals with transportation problems whose demand vectors can be permuted. This additional freedom makes these problems ??-hard, even in the case that the cost matrix fulfills a Monge property. We outline some solution procedures based on good lower and upper bounds. Copyright Springer-Verlag Berlin Heidelberg 1999

Keywords: Key words: Transportation problems; permuted demand vector; computational complexity; Monge property; solution procedure (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/PL00020922 (text/html)
Access to full text is restricted to subscribers.

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:spr:mathme:v:50:y:1999:i:1:p:1-7

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/PL00020922

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().