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 κ.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Manuscript received: August 1998/final version received: March 1999
Rights and permissions
About this article
Cite this article
Hujter, M., Klinz, B. & Woeginger, G. A note on the complexity of the transportation problem with a permutable demand vector. Mathematical Methods of OR 50, 9–16 (1999). https://doi.org/10.1007/PL00020923
Issue Date:
DOI: https://doi.org/10.1007/PL00020923