A note on the complexity of the transportation problem with a permutable demand vector

Mihály Hujter, Bettina Klinz and Gerhard J. Woeginger

Mathematical Methods of Operations Research, 1999, vol. 50, issue 1, 9-16

Abstract: In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b=(b 1 ,…,b n ) in order to minimize the overall transportation costs. Meusel and Burkard [6] recently proved that the TP-PD is strongly NP-hard. In their NP-hardness reduction, the used demand values b j , j=1,…,n, are large integers. In this note we show that the TP-PD remains strongly NP-hard even for the case where b j ∈{0,3} for j=1,…,n. As a positive result, we show that the TP-PD becomes strongly polynomial time solvable if b j ∈{0,1,2} holds for j=1,…,n. This result can be extended to the case where b j ∈{κ,κ+1,κ+2} for an integer κ. Copyright Springer-Verlag Berlin Heidelberg 1999

Keywords: Key words: Transportation problem; permutable demand vector; computational complexity; minimum weight f-factor problem (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/PL00020923 (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:9-16

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

DOI: 10.1007/PL00020923

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