Skip to main content
SpringerLink
Log in

A transportation problem with a permuted demand vector

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Universität Leipzig, Wirtschaftswissenschaftliche Fakultät, Institut für Wirtschaftsinformatik, Marschnerstr. 31, D-04109 Leipzig, Germany (e-mail: smeusel@gmx.de), , , , , , DE

    Steffen G. Meusel

  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

    Rainer E. Burkard

Authors
  1. Steffen G. Meusel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rainer E. Burkard
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Manuscript received: August 1998/final version received: January 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meusel, S., Burkard, R. A transportation problem with a permuted demand vector. Mathematical Methods of OR 50, 1–7 (1999). https://doi.org/10.1007/PL00020922

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00020922

Search

Navigation