Abstract
The decentralized transportation problem is under study where the customers act individually maximizing their own profits while the producer determines only the sequence of their service. The problem is shown to be NP-hard, and some effective approximation algorithm is suggested with a guaranteed approximation bound in the case of the same demand volumes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (WH Freeman, 1979).
E. A. Dinitz, “Algorithm of Digital Reduction of Residuals and Transportation Problems,” in Studies on Discrete Mathematics (Nauka, Moscow, 1973), pp. 46–57.
N. Christophides, Graph Theory: An Algorithmic Approach (Academic Press, New York, 1975).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.T. Dementiev, A.V. Pyatkin, 2008, published in Diskretnyi Analiz i Issledovanie Operatsii, 2008, Vol. 15, No. 3, pp. 22–30.
Rights and permissions
About this article
Cite this article
Dementiev, V.T., Pyatkin, A.V. On the decentralized transportation problem. J. Appl. Ind. Math. 3, 32–37 (2009). https://doi.org/10.1134/S1990478909010050
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478909010050