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

Yury Glazkov ()
Additional contact information
Yury Glazkov: Sobolev Institute of Mathematics SB RAS

A chapter in Operations Research Proceedings 2006, 2007, pp 175-179 from Springer

Abstract: 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.

Date: 2007
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-69995-8_29

Ordering information: This item can be ordered from
http://www.springer.com/9783540699958

DOI: 10.1007/978-3-540-69995-8_29

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().