Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
DOI10.1007/s10559-007-0023-0zbMath1135.90359OpenAlexW2051601403MaRDI QIDQ2458107
Publication date: 31 October 2007
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-007-0023-0
maximum noninteger vertexcompletely \(r\)-noninteger vertexidentification of types of verticespolytope ofthree-index axial assignment problem
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (8)
Cites Work
- Unnamed Item
- 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
- Types of \((3n-2)\)-noninteger vertices of the polytope of three-index axial problem of choice
- Facets of the three-index assignment polytope
- On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
- On non-integer vertices of the polytope of the three-index axial assignment problem
- Letter to the Editor—The Multidimensional Assignment Problem
This page was built for publication: Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem