Skip to main content
SpringerLink
Log in

Investigation of polynomial algorithms for solving the 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 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 conducted.

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. A. M. Frieze, “Complexity of a 3-Dimensional Assignment Problem,” European J. Operat. Res., No. 13, 161–164 (1983).

  2. R. E. Burkard and K. Frohlich, “Some Remarks on 3-Dimensional Assignment Problems,” Methods of 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).

    Google Scholar 

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

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

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

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

  9. 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 

  10. 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).

  11. 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 

  12. 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 

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

    Google Scholar 

  14. 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 

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

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, 2006, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2006, Vol. 46, No. 2, pp. 222–228.

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 three-index planar assignment problem. Comput. Math. and Math. Phys. 46, 212–217 (2006). https://doi.org/10.1134/S0965542506020047

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation