Skip to main content
SpringerLink
Log in

Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem

  • Published:
Russian Mathematics Aims and scope Submit manuscript

Abstract

We describe various types of maximum noninteger vertices. We identify types of polyhedron vertices by the number of fractional components contained in three-sections of fourindex matrices representing the polyhedron vertices.

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. E. Balas and M. J. Saltzman, “Facets of the Three-Index Assignment Polytope,” Discrete Appl. Math. 23(3), 201–229 (1989).

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. V. M. Kravtsov, “On a Characterization of Noninteger Vertices of the Relaxation Polyhedron of the Multi-Index Axial Assignment Problem,” Zhurn. Vychisl. Matem. iMatem. Fiz. 50(9), 1697–1708 (2010).

    MathSciNet  MATH  Google Scholar 

  5. V. A. Emelichev, M. M. Kovalyev, and M. K. Kravtsov, Polyhedrons, Graphs, Optimization (Nauka, Moscow, 1981) [in Russian].

    Google Scholar 

  6. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “On the Number of Non-integer Vertices of the Polytope of the Three-Index Axial Assignment Problem,” Vestsi NAN Belarusi, Ser. Fiz.-Matem. Navuk, No. 4, 59–65 (2000).

  7. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “On Non-Integer Vertices of the Polytope of the Three-Index Axial Assignment Problem,” Diskretn.Matem. 13(2), 120–143 (2001).

    MathSciNet  Google Scholar 

  8. M. K. Kravtsov, V. M. Kravtsov, and E. V. Lukshin, “Types of (3n − 2)-Noninteger Vertices of the Polytope of Three-Index Axial Problem of Choice,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 12, 84–90 (2002) [Russian Mathematics (Iz. VUZ) 46 (12), 82–88 (2002)].

  9. V. M. Kravtsov, “On the Maximum Noninteger Polyhedron Vertices of the Three-Index Axial Assignment Problem,” Avtomatika i Telemekhanika, No. 3, 62–70 (2004).

  10. V. M. Kravtsov, “Description of the Types of Maximum Noninteger Vertices of the Polyhedron in the Three-Index Axial Assignment Problem,” Zhurn. Vychisl. Matem. iMatem. Fiz. 46(10), 1908–1912 (2006).

    MathSciNet  Google Scholar 

  11. V. M. Kravtsov, “The Characterization of Types of Maximally Noninteger Vertices of a Polyhedron in the Three-Index Axial Assignment Problem,” Izv. Vyssh. Uchebn. Zaved.Mat., No. 12, 65–68 (2006) [Russian Mathematics (Iz. VUZ) 50 (12), 63–66 (2006)].

  12. V.M. Kravtsov, “Combinatorial Properties of Noninteger Vertices of the Polyhedron of the Three-Index Axial Assignment Problem,” Kibernetika i Sistemnyi Analiz,№1, 33–44 (2007).

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

  14. M. K. Kravtsov and E. V. Lukshin, “On the Maximum Noninteger Polyhedron Vertices in the Three-Index Axial Assignment Problem,” Avtomatika i Telemekhanika, No. 3, 71–79 (2004).

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

    Article  MathSciNet  MATH  Google Scholar 

  16. M. K. Kravtsov and E. V. Lukshin, “On Noninteger Vertices of the Polytope of Multi-Index Axial Choice Problem,” Izv. Vyssh. Uchebn. Zaved. Mat., No. 12, 65–70 (1999) [Russian Mathematics (Iz. VUZ) 43 (12), 61–66 (1999)].

Download references

Author information

Authors and Affiliations

  1. The Research Economic Institute, Ministry of Economics, Republic of Belarus, ul. Slavinskogo 1/1, Minsk, 220086, Republic of Belarus

    M. K. Kravtsov

  2. AITOC “Nova Tur”, pr. Nezavisimosti 63, Minsk, 220013, Republic of Belarus

    V. M. Kravtsov

Authors
  1. M. K. Kravtsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. 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 © M.K. Kravtsov and V.M. Kravtsov, 2012, published in Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika, 2012, No. 3, pp. 9–16.

About this article

Cite this article

Kravtsov, M.K., Kravtsov, V.M. Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem. Russ Math. 56, 6–13 (2012). https://doi.org/10.3103/S1066369X12030024

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S1066369X12030024

Keywords and phrases

Search

Navigation