Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem

DOI10.1134/s0965542506100174OpenAlexW2018053467MaRDI QIDQ6200618

V. M. Kravtsov

Publication date: 1 March 2024

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

Full work available at URL: http://mathnet.ru/eng/zvmmf407

zbMATH Keywords

maximum noninteger vertex\(r\)-noninteger vertexidentification of vertex typespolyhedron of three-index axial assignment problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites Work

• Unnamed Item
• Unnamed Item
• A three-dimensional matching model for perishable production scheduling
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem