Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem

ISSN： 1060-0396

Source： Cybernetics and Systems Analysis, Vol.43, Iss.1, 2007-01, pp. : 25-33

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem

By Kravtsov M. Kravtsov V.

Computational Mathematics and Mathematical Physics, Vol. 53, Iss. 5, 2013-05 ,pp. : 655-665

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Asymptotic Approach to the Solution of a Multicriterion Three-Index Planar Problem of Choice

By Kravtsov M. K. Dichkovskaya S. A.

Cybernetics and Systems Analysis, Vol. 40, Iss. 3, 2004-05 ,pp. : 324-328

Springer Publishing Company

Access to resources Recommend Favorite

Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem

By Kravtsov V.

Cybernetics and Systems Analysis, Vol. 41, Iss. 6, 2005-11 ,pp. : 940-944

Springer Publishing Company

Access to resources Recommend Favorite

A Combinatorial Problem

STUDIES IN APPLIED MATHEMATICS, Vol. 97-1421, Iss. 1, 1933-04 ,pp. : 321-333

John Wiley & Sons Inc

Access to resources Recommend Favorite

A Combinatorial Problem

STUDIES IN APPLIED MATHEMATICS, Vol. 12, Iss. 1, 1933-04 ,pp. : 321-333

John Wiley & Sons Inc

Access to resources Recommend Favorite