On the maximum noninteger polyhedron vertices of the three-index axial assignment problem

DOI10.1023/B:AURC.0000019373.19011.57zbMath1075.90046OpenAlexW2011664500MaRDI QIDQ2487735

V. M. Kravtsov

Publication date: 8 August 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:aurc.0000019373.19011.57

zbMATH Keywords

assignment problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (4)

Unnamed Item ⋮ Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem ⋮ 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 maximum noninteger polyhedron vertices of the three-index axial assignment problem