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

DOI10.1134/S0965542510090125zbMath1222.90047OpenAlexW2067285760MaRDI QIDQ2996002

V. M. Kravtsov

Publication date: 4 May 2011

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542510090125

zbMATH Keywords

polyhedraassignment problemnoninteger vertices\(r\)-noninteger matrixrelaxation polyhedron

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (2)

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

This page was built for publication: On the characterization of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem