A transportation problem with a permuted demand vector

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

MoreLess

Year of publication:	1999
Authors:	Meusel, Steffen G. ; Burkard, Rainer E.
Published in:	Computational Statistics. - Springer. - Vol. 50.1999, 1, p. 1-7
Publisher:	Springer
Subject:	Transportation problems \| permuted demand vector \| computational complexity \| Monge property \| solution procedure

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010759252