Skip to main content
SpringerLink
Log in

On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem

  • Conference paper
Operations Research Proceedings 2006

Part of the book series: Operations Research Proceedings ((ORP,volume 2006))

  • 2372 Accesses

Abstract

In the paper the m-layer planar 3-dimensional assignment problem is considered. It is an NP-hard modification of well-known planar 3-dimensional assignment problem. Approximation algorithm, proposed by Gimadi and Korkishko is analysed. Its asymptotical optimality for a special class of random instances is proved.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Frieze A (1983) Complexity of a 3-dimensional assignment problem. European J. Oper. Res. V 13, N 2: 161–164.

    Article  Google Scholar 

  2. Gimadi E (2005) On some probability inequalities in some discrete optimization problems. // Operation Research Proceedings 2005, to appear in 2006.

    Google Scholar 

  3. Gimadi E, Korkishko N (2004) On some modifications of three index planar assignment problem // Discrete optimization methods in production and logistics. The second int. workshop (Omsk, July 20–27, 2004). Proc. DOM’2004, Omsk, 2004. P. 161–165.

    Google Scholar 

  4. Hopcroft J, Karp R (1973) An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. V. 2, N 4: 225–231.

    Article  Google Scholar 

  5. Kravtsov M, Krachkovskii A (2001) O polinomialnom algoritme nahozhdeniia asimptoticheski optimalnogo resheniia trehindeksnoi planarnoi problemi vibora. Zhurnal vichislitelnoi matematiki i matematicheskoi fiziki T. 41, ü 2: 342–345.

    Google Scholar 

  6. Ore O (1980) Teoriia grafov. Nauka, Moskva

    Google Scholar 

  7. Petrov V (1987) Predelnie teoremi dlia summ nezavisimih sluchainih velichin. Nauka, Moskva

    Google Scholar 

  8. Vozniuk I, Gimadi E, Fialtov M (2001) Asimptoticheski tochnii algoritm dlia resheniia zadachi razmesheniia s ogranichennimi obiemami proizvodstva. Diskretnii analiz i issledovanie operatsii Ser. 2. T. 8, ü 2:3–16.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, Novosibirsk, Russia

    Yury Glazkov

Authors
  1. Yury Glazkov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe (TH), Kaiserstraße 12, 76131, Karlsruhe, Germany

    Karl-Heinz Waldmann  & Ulrike M. Stocker  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Glazkov, Y. (2007). On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem. In: Waldmann, KH., Stocker, U.M. (eds) Operations Research Proceedings 2006. Operations Research Proceedings, vol 2006. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69995-8_29

Download citation

Publish with us

Policies and ethics

Search

Navigation