Abstract:
A decentralized transportation problem is considered, where the customers act individually maximizing their own profit, while the producer can only determine the sequence of their service. It is shown that this problem is
NP-hard. An aproximate polynomial algorithm with a guaranteed ratio is proposed in the case of the same demand values. Bibl. 3.
Fulltext:
PDF file (248 kB)