Skip to main content
SpringerLink
Log in

Multi-index Transportation Problems

MITP

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Formulations

Applications

  Transportation and Logistics

  Timetabling

  Multitarget Tracking

  Tables with Given Marginals

  Other Applications

Solution Methods

  A Greedy Algorithm for Axial MITPs

  A Monge Property

  Hub Heuristics for Axial MITPs

See also

References

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bammi D (1978) A generalized-indices transportation problem. Naval Res Logist Quart 25:697–710

    Article  MathSciNet  MATH  Google Scholar 

  2. Bandelt H-J, Crama Y, Spieksma FCR (1994) Approximation algorithms for multidimensional assignment problems with decomposable costs. Discrete Appl Math 49:25–50

    Article  MathSciNet  MATH  Google Scholar 

  3. Bein WW, Brucker P, Park JK, Pathak PK (1995) A Monge property for the d-dimensional transportation problem. Discrete Appl Math 58:97–109

    Article  MathSciNet  MATH  Google Scholar 

  4. Corban A (1964) A multidimensional transportation problem. Rev Roumaine Math Pures et Appl IX:721–735

    MathSciNet  Google Scholar 

  5. Corban A (1966) On a three-dimensional transportation problem. Rev Roumaine Math Pures et Appl XI:57–75

    Google Scholar 

  6. Crama Y, Spieksma FCR (1992) Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Europ J Oper Res 60:273–279

    Article  MATH  Google Scholar 

  7. Euler R, Le Verge H (1996) Time-tables, polyhedra and the greedy algorithm. Discrete Appl Math 65:207–222

    Article  MathSciNet  MATH  Google Scholar 

  8. Faigle U, Kern W (1996) Submodular linear programs on forests. Math Program 72:195–206

    MathSciNet  Google Scholar 

  9. Fortin D, Tusera A (1994) Routing in meshes using linear assignment. In: Bachem A, Derigs U, Jünger M, Schrader R (eds) Operation Research 93, pp 169–171

    Google Scholar 

  10. Frieze AM, Yadegar J (1981) An algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practice. J Oper Res Soc 32:989–995

    Article  MATH  Google Scholar 

  11. Geetha S, Vartak MN (1994) The three-dimensional bottleneck assignment problem with capacity constraints. Europ J Oper Res 73:562–568

    Article  MATH  Google Scholar 

  12. Gilbert KC, Hofstra RB (1987) An algorithm for a class of three-dimensional assignment problems arising in scheduling applications. IIE Trans 8:29–33

    Article  Google Scholar 

  13. Haley KB (1962) The solid transportation problem. Oper Res 10:448–463

    Article  MATH  Google Scholar 

  14. Haley KB (1963) The multi-index problem. Oper Res 11:368–379

    Article  MATH  Google Scholar 

  15. Junginger W (1972) Zurückführung des Stundenplanproblems auf einen dreidimensionales Transportproblem. Z Oper Res 16:11–25

    Article  MathSciNet  Google Scholar 

  16. Junginger W (1993) On representatives of multi-index transportation problems. Europ J Oper Res 66:353–371

    Article  MATH  Google Scholar 

  17. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp 85–103

    Google Scholar 

  18. Magos D (1996) Tabu search for the planar three-index assignment problem. J Global Optim 8:35–48

    Article  MathSciNet  MATH  Google Scholar 

  19. Magos D, Miliotis P (1994) An algorithm for the planar three-index assignment problem. Europ J Oper Res 77:141–153

    Article  MATH  Google Scholar 

  20. Mavridou T, Pardalos PM, Pitsoulis L, Resende MGC (1998) A GRASP for the biquadratic assignment problem. Europ J Oper Res 105/3:613–621

    Article  Google Scholar 

  21. Miller JL, Frank LS (1996) A binary-rounding heuristic for multi-period variable-task duration assignment problems. Comput Oper Res 23:819–828

    Article  MATH  Google Scholar 

  22. Motzkin T (1952) The multi-index transportation problem. Bull Amer Math Soc 58:494

    Google Scholar 

  23. Murphey R, Pardalos PM, Pitsoulis L (1998) A GRASP for the multitarget multisensor tracking problem. In: DIMACS, vol 40. Amer Math Soc, Providence, pp 277–302

    Google Scholar 

  24. Murphey R, Pardalos PM, Pitsoulis L (1998) A parallel GRASP for the data association multidimensional assignment problem. In: IMA Vol Math Appl, vol 106. Springer, Berlin, pp 159–180

    MathSciNet  Google Scholar 

  25. Pattipatti KR, Deb S, Bar-Shalom Y, Washburn RB Jr (1990) Passive multisensor data association using a new relaxation algorithm. In: Bar-Shalom Y (ed) Multitarget-multisensor tracking: Advances and applications, p 111

    Google Scholar 

  26. Pattipatti KR, Deb S, Bar—Shalom Y, Washburn RB Jr (1992) A new relaxation algorithm passive sensor data association. IEEE Trans Autom Control 37:198–213

    Article  Google Scholar 

  27. Pierskalla WP (1968) The multidimensional assignment problem. Oper Res 16:422–431

    Article  MATH  Google Scholar 

  28. Poore AB (1994) Multidimensional assignment formulation of data-association problems arising from multitarget and multisensor tracking. Comput Optim Appl 3:27–57

    Article  MathSciNet  MATH  Google Scholar 

  29. Poore AB, Rijavec N (1993) A Lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking. SIAM J Optim 3:544–563

    Article  MathSciNet  MATH  Google Scholar 

  30. Queyranne M, Spieksma FCR (1997) Approximation algorithms for multi-index transportation problems with decomposable costs. Discrete Appl Math 76:239–253

    Article  MathSciNet  MATH  Google Scholar 

  31. Queyranne M, Spieksma FCR, Tardella F (1993) A general class of greedily solvable linear programs. In: Rinaldi G, Wolsey L (eds) Proc Third IPCO Conf (Integer Programming and Combinatorial Optimization), pp 385–399

    Google Scholar 

  32. Queyranne M, Spieksma FCR, Tardella F (1998) A general class of greedily solvable linear programs. Math Oper Res 23(4):892–908

    Article  MathSciNet  MATH  Google Scholar 

  33. Rautman CA, Reid RA, Ryder EE (1993) Scheduling the disposal of nuclear waste material in a geologic repository using the transportation model. Oper Res 41:459–469

    Google Scholar 

  34. Romero D (1990) Easy transportation-like problems on K-dimensional arrays. J Optim Th Appl 66:137–147

    Article  MathSciNet  MATH  Google Scholar 

  35. Schell E (1955) Distribution of a product by several properties. In: Directorate of Management Analysis (ed) Second Symposium in Linear Programming 2. DCS/Comptroller HQ, US Air Force, Washington DC, pp 615–642

    Google Scholar 

  36. Sharma JK, Sharup K (1977) Time-minimizing multidimensional transportation problem. J Eng Production 1:121–129

    Google Scholar 

  37. Spieksma FCR, Woeginger GJ (1996) Geometric three-dimensional assignment problems. Europ J Oper Res 91:611–618

    Article  MATH  Google Scholar 

  38. Tzeng G, Teodorović D, Hwang M (1996) Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower. Europ J Oper Res 95:62–72

    Article  MATH  Google Scholar 

  39. Vlach M (1967) Branch and bound method for the three-index assignment problem. Ekonomicko–Matematicky Obzor 3:181–191

    MathSciNet  Google Scholar 

  40. Vlach M (1986) Conditions for the existence of solutions of the three-dimensional planar transportation problem. Discrete Appl Math 13:61–78

    Article  MathSciNet  MATH  Google Scholar 

  41. Yemelichev VA, Kovalev MM, Kratsov MK (1984) Polytopes, graphs and optimization. Cambridge Univ Press, Cambridge

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University British Columbia, Vancouver, Canada

    Maurice Queyranne

  2. Maastricht University, Maastricht, The Netherlands

    Frits Spieksma

Authors
  1. Maurice Queyranne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frits Spieksma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Queyranne, M., Spieksma, F. (2008). Multi-index Transportation Problems . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_415

Download citation

Publish with us

Policies and ethics

Search

Navigation