Skip to main content
SpringerLink
Log in

Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

Under certain additional conditions imposed on the coefficients of the vector objective function in the three-index planar assignment problem, a large series of computational experiments aimed at the investigation of four polynomial algorithms for finding an asymptotically optimal solution of this problem is carried out.

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

References

  1. V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization (Nauka, Moscow, 1981) [in Russian].

    Google Scholar 

  2. R. E. Burkard and K. Frohlich, “Some Remarks on 3-Dimensional Assignment Problems,” Meth. Operat. Res., No. 36, 31–36 (1980).

  3. E. Balas and P. Landweer, “Traffic Assignment in Communication Satellites,” Operat. Res., No. 2, 141–147 (1983).

  4. C. F. Laywine and G. L. Mullen, Discrete Mathematics Using Latin Squares (Wiley, New York, 1998).

    MATH  Google Scholar 

  5. D. Magos, I. Mourtos, and G. Appa, “Polyhedral Results for Assignment Problems,” CDAM Res. Rep. ISECDAM-2002-01.

  6. R. Euler and H. Verge Le, “Time-Tables, Polyhedra and the Greedy Algorithm,” Discrete Appl. Math., No. 65, 207–221 (1996).

  7. A. M. Frieze, “Complexity of a 3-Dimensional Assignment Problem,” Europ. J. Operat. Res., No. 13, 161–164 (1983).

  8. N. N. Kuzyurin, “Average Complexity of the Integer Programming Problem,” in Proc. of the Russian Conf. on Discrete Analysis and Operations Research, Novosibirsk, 2004, pp. 39–40.

  9. V. A. Perepelitsa, “On Two Problems in Graph Theory,” Dokl. Akad. Nauk SSSR 194, 1269–1272 (1970).

    MathSciNet  Google Scholar 

  10. E. Kh. Gimadi, N. I. Glebov, and A. I. Serdyukov, “An Algorithm for the Approximate Solution of the Traveling Salesman Problem and Its Probailistic Analysis,” Sib. Mat. Zh. Issl. Operatsii 1(2), 8–17 (1994).

    MathSciNet  Google Scholar 

  11. A. D. Korshunov, “Basic Properties of Random Graphs with a Large Number of Vertices and Edges,” Usp. Mat. Nauk 40(1), 107–173 (1985).

    MATH  MathSciNet  Google Scholar 

  12. V. A. Emelichev and V. A. Perepelitsa, “Complexity of Discrete Multicriteria Problems,” Diskretn. Mat. 6(1), 3–33 (1994).

    MathSciNet  Google Scholar 

  13. V. A. Emelichev and N. E. Efimchik, “An Asymptotic Approach to the Problem of k-Median of a Graph,” Kibern. Sistemn. Anal., No. 5, 109–117 (1994).

    Google Scholar 

  14. I. V. Segrienko and V. A. Perepelitsa, “On the Problem of Finding a Set of Alternatives in Discrete Multicriteria Problems,” Kibernetika, No. 5, 85–93 (1987).

  15. V. A. Emelichev, V. A. Perepelitsa, and Kh. D. Shungerov, “An Asymptotic Approach to the Multicriteria Problem of Covering a Graph by Stars,” Dokl. Akad. Nauk BSSR 31(5), 5–9 (1985).

    Google Scholar 

  16. M. K. Kravtsov and A. P. Krachkovskii, “Asymptotic Optimality of the Solution to the Transportation Problem Found by the Minimal Element Method,” Kibern. Sistemn. Anal., No. 1, 144–151 (1999).

  17. M. K. Kravtsov and A. P. Krachkovskii, “Asymptotic Approach to Solving the Multi-Index Axial Transportation Problem,” Zh. Vychisl. Mat. Mat. Fiz. 38, 1133–1139 (1998) [Comput. Math. Math. Phys. 38, 1083–1089 (1998)].

    MathSciNet  Google Scholar 

  18. M. K. Kravtsov and A. P. Krachkovskii, “An Asymptotic Approach to Solving the Multi-Index Assignment Problem,” Vest. Nats. Akad. Nauk Belarusi, Ser. Fiz. Mat., No. 2, 123–126 (1999).

  19. V. M. Kravtsov, “Polynomial Algorithms for Finding Asymptotically Optimal Solutions of Multidimensional Axial Assignment Problems,” Kibern. Sistemn. Anal., No. 6, 176–181 (2005).

  20. M. K. Kravtsov and A. P. Krachkovskii, “Polynomial Algorithm for Finding an Asymptotically Optimal Solution to the Multi-index Planar Choice Problem,” Zh. Vychisl. Mat. Mat. Fiz. 41, 342–345 (2001) [Comput. Math. Math. Phys. 41, 318–321 (2001)].

    MathSciNet  Google Scholar 

  21. S. Smale, “On the Average Number of Steps in the Simplex Method of Linear Programming,” Math. Progr. 27(1), 241–262 (1983).

    Article  MATH  MathSciNet  Google Scholar 

  22. N. N. Kuzyurin, “A Polynomial in the Mean Algorithm in Integer Linear Programming,” Sib. Mat. Zh. Issl. Operatsii 1(3), 38–48 (1994).

    MathSciNet  Google Scholar 

  23. N. N. Kuzyurin, “Metric Aspects of the Theory of Integer Linear Programming,” Diskretn. Mat. 6(4), 87–106 (1994).

    MathSciNet  Google Scholar 

  24. M. K. Kravtsov and A. P. Krachkovskii, “A Polynomial Algorithm for the Multi-Index Decision Problem,” Zh. Vychisl. Mat. Mat. Fiz. 39, 1041–1044 (1999) [Comput. Math. Math. Phys. 39, 1002–1005 (1999)].

    MathSciNet  Google Scholar 

  25. M. K. Kravtsov and A. P. Krachkovskii, “Remark on the Paper “A Polynomial Algorithm for the Multi-index Choice Problem,” Zh. Vychisl. Mat. Mat. Fiz. 40, 1440 (2000) [Comput. Math. Math. Phys. 40, 1381 (2000)].

    MathSciNet  Google Scholar 

  26. S. A. Dichkovskaya and M. K. Kravtsov, “Investigation of Polynomial Algorithms for Solving the Three-Index Planar Assignment Problem,” Zh. Vychisl. Mat. Mat. Fiz. 46(2), 222–228 (2006) [Comput. Math. Math. Phys. 46, 212–217 (2006)].

    MathSciNet  Google Scholar 

  27. M. K. Kravtsov and S. A. Dichkovskaya, “An Asymptotic Approach Solving the Three-Index Planar Assignment Problem,” Kibern. Sistemn. Anal., No. 3, 24–29 (2004).

  28. E. A. Dinits and M. A. Kronrod, “An Algorithm for Solving the Assignment Problem,” Dokl. Akad. Nauk SSSR 189(1), 23–25 (1969).

    MathSciNet  Google Scholar 

  29. V. A. Emelichev and M. K. O. Kravtsov, “On the Nonsolvability of Vector Discrete Optimization Problems on Systems of Subsets in the Class of Algorithms Based on Linear Scalarizing Functions,” Dokl. Akad. Nauk 334, 9–11 (1994).

    MathSciNet  Google Scholar 

  30. V. I. Podinovskii and V. D. Noghin, Pareto-Optimal Solutions of Multicriteria Problems (Nauka, Moscow, 1982) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Economics Research Institute, Ministry for Economics of the Republic of Belarus, ul. Slavinskogo 1, korp. 1, Minsk, 220086, Belarus

    S. A. Dichkovskaya & M. K. Kravtsov

Authors
  1. S. A. Dichkovskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. K. Kravtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © S.A. Dichkovskaya, M.K. Kravtsov, 2007, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2007, Vol. 47, No. 6, pp. 1077–1086.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dichkovskaya, S.A., Kravtsov, M.K. Investigation of polynomial algorithms for solving the multicriteria three-index planar assignment problem. Comput. Math. and Math. Phys. 47, 1029–1038 (2007). https://doi.org/10.1134/S0965542507060127

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542507060127

Keywords

Search

Navigation