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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Frieze A (1983) Complexity of a 3-dimensional assignment problem. European J. Oper. Res. V 13, N 2: 161–164.
Gimadi E (2005) On some probability inequalities in some discrete optimization problems. // Operation Research Proceedings 2005, to appear in 2006.
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.
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.
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.
Ore O (1980) Teoriia grafov. Nauka, Moskva
Petrov V (1987) Predelnie teoremi dlia summ nezavisimih sluchainih velichin. Nauka, Moskva
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
DOI: https://doi.org/10.1007/978-3-540-69995-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69994-1
Online ISBN: 978-3-540-69995-8
eBook Packages: Business and EconomicsBusiness and Management (R0)