On non-integer vertices of the polytope of the three-index axial assignment problem

DOI10.1515/dma.2001.11.3.303zbMath1134.90549OpenAlexW1989135095MaRDI QIDQ4809529

V. M. Kravtsov, E. V. Lukshin, M. K. Kravtsov

Publication date: 30 August 2004

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/dm/13/2/120

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (7)

Unnamed Item ⋮ 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 ⋮ Polyhedral combinatorics of multi-index axial transportation problems ⋮ Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors

This page was built for publication: On non-integer vertices of the polytope of the three-index axial assignment problem