A transportation problem with a permuted demand vector

  • Steffen G. Meusel
  • Rainer E. Burkard


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.

Key words: Transportation problems permuted demand vector computational complexity Monge property solution procedure 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Steffen G. Meusel
    • 1
  • Rainer E. Burkard
    • 2
  1. 1.Universität Leipzig, Wirtschaftswissenschaftliche Fakultät, Institut für Wirtschaftsinformatik, Marschnerstr. 31, D-04109 Leipzig, Germany (e-mail: smeusel@gmx.de)DE
  2. 2.Technische Universität Graz, Institut für Mathematik, Steyrergasse 30, A-8010 Graz, Austria (e-mail: burkard@opt.math.tu-graz.ac.at)AT

Personalised recommendations