Skip to main content
SpringerLink
Log in

On the characterization of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem

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

Abstract

Theorems about the characterization and exponential growth of the denominators of fractional components of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem are proved. They made it possible to obtain new lower bounds on the number of noninteger vertices of this polyhedron and to refute the conjecture on the estimate of the ratio of the number of integer vertices to the number of all vertices of the multi-index axial transportation polyhedron determined by integer vectors.

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. Karp, “Reducibility among Combinatorial Problems,” In Complexity of Computer Computations (Plenum, New York, 1972), pp. 86–103.

    Google Scholar 

  3. R. Burkard, R. Rudolf, and G. Woeginger, “Three-Dimensional Axial Assignement Problems with Decomposable Cost-Coefficients,” Discrete Appl. Math. 65, 123–140 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  4. C. Arbib, D. Pacciarelli, and S. A. Smriglio, “Three-Dimensional Matching Model for Perishable Production Scheduling,” Discrete Appl. Math. 92, 1–15 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  5. Y. Grama, A. Oerlemans, and F. Spieksma, Production Planning in Automated Manufacturing (Springer, Berlin, 1996).

    Google Scholar 

  6. A. B. Poore, “Multidimensional Assigment Formulation of Data Association Problems Arising from Multitarget and Multisensor Tracking,” Comput. Optimizat. Appl. 3, 27–54 (1994).

    Article  MATH  MathSciNet  Google Scholar 

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

  8. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “On the Noninteger Vertices of the Polyhedron in the Three-Index Axial Assignment Problem,” Diskretnaya Mat. 13(2), 120–143 (2001).

    MathSciNet  Google Scholar 

  9. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “On the Number of Noninteger Vertices of the Polyhedron of the Three-Index Axial Assignment Problem,” Vestsi National Academy of Sci. Belarus., Ser. Fiz.-Mat. Navuk No. 4, 59–65 (2000).

  10. V. M. Kravtsov, “Combinatorial Properties of Noninteger Vertices of the Polyhedron of the Three-Index Axial Assignment Problem,” Kibern. Sistemn. Anal., No. 1, 33–44 (2007).

  11. V. M. Kravtsov, “New Properties of the Maximally Noninteger Vertices of the Polyhedron of the Three-Index Axial Assignment Problem,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 12, 37–45 (2004).

  12. V. M. Kravtsov, “A Type of the Maximally Noninteger Vertices of the Polyhedron of the Three-Index Axial Assignment Problem,” Vestn. Bel. Gos. Univ., Ser. 1., No. 3, 83–90 (2005).

  13. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “On the Types of (3n − 2)-Noninteger Vertices of the Polyhedron of the Three-Index Axial Selection Problem,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 12, 84–90 (2002).

  14. V. M. Kravtsov, “On Maximally Noninteger Vertices of the Polyhedron in the Three-Index Axial Assignment Problem,” Avtom. Telemekh., No. 3, 62–70 (2004).

  15. V. M. Kravtsov, “Characterization of the Types of Maximum Noninteger Vertices of the Polyhedron in the Three-Index Axial Assignment Problem,” Zh. Vychisl. Mat. Mat. Fiz. 46, 1908–1912 (2006) [Comput. Math. Math. Phys. 46, 1821–1825 (2006)].

    MathSciNet  Google Scholar 

  16. V. M. Kravtsov, “Characterization of the Types of Completely Noninteger Vertices of the Polyhedron of the Three-Index Axial Assignment Problem,” Vestn. Bel. Gos. Univ., Ser. 1., No. 1, 108–113 (2007).

  17. M. K. Kravtsov and E. V. Lukshin, “On Noninteger Vertices of the Polyhedron of the Three-Index Axial Selection Problem,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 12, 65–70 (1999).

  18. M. K. Kravtsov and E. V. Lukshin, “On Noninteger Vertices of the Polyhedron of the Three-Index Axial Transportation Problem,” Avtom. Telemekh., No. 3, 71–79 (2004).

  19. M. K. Kravtsov and E. V. Lukshin, “Polyhedral Combinatorics of Multi-Index Axial Transportation Problems,” European J. Operat. Res., No. 189, 920–938 (2008).

    Google Scholar 

  20. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “On the Number of r-Noninteger Vertices of the Polyhedron of the Three-Index Axial Selection Problem,” Izv. Vyssh. Uchebn. Zaved., Mat., No. 12, 89–92 (2000).

  21. V. A. Emelichev and M. K. Kravtsov, “Polyhedral Aspects of Multi-index Axial Transportation Problems,” Diskretnaya Mat. 3(2), 3–24 (1991).

    MathSciNet  Google Scholar 

  22. V. N. Shevchenko, Qualitative Issues in Integer Programming (Nauka, Moscow, 1995) [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

    V. M. Kravtsov

Authors
  1. V. M. Kravtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. M. Kravtsov.

Additional information

Original Russian Text © V.M. Kravtsov, 2010, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2010, Vol. 50, No. 9, pp. 1697–1708.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kravtsov, V.M. On the characterization of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem. Comput. Math. and Math. Phys. 50, 1615–1626 (2010). https://doi.org/10.1134/S0965542510090125

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Key words

Search

Navigation