Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
From MaRDI portal
Publication:1759247
DOI10.3103/S1066369X12030024zbMath1251.90328OpenAlexW1998869495MaRDI QIDQ1759247
M. K. Kravtsov, V. M. Kravtsov
Publication date: 20 November 2012
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x12030024
vertex typemaximum noninteger vertexrelaxation polyhedron of four-index axial assignment problemthree-section of four-index matrix
Related Items (1)
Cites Work
- A three-dimensional matching model for perishable production scheduling
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- Types of \((3n-2)\)-noninteger vertices of the polytope of three-index axial problem of choice
- Noninteger vertices of the polytope of multi-index axial choice problem
- Facets of the three-index assignment polytope
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
- Polyhedral combinatorics of multi-index axial transportation problems
- On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
- On the noninteger polyhedron vertices of the three-index axial transportation problem
- On the characterization of noninteger vertices of the relaxation polyhedron in the multi-index axial assignment problem
- On non-integer vertices of the polytope of the three-index axial assignment problem
- Unnamed Item
- Unnamed Item
This page was built for publication: Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
