On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
From MaRDI portal
Publication:2487735
DOI10.1023/B:AURC.0000019373.19011.57zbMATH Open1075.90046OpenAlexW2011664500MaRDI QIDQ2487735FDOQ2487735
Authors: 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
Recommendations
- On a type of maximal noninteger vertices of the polytope of the three-index axial assignment problem
- On non-integer vertices of the polytope of the three-index axial assignment problem
- scientific article; zbMATH DE number 2195325
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
- scientific article; zbMATH DE number 1783769
- Characterization of the types of completely noninteger vertices of the three-index axial assignment problem polytope
- On the noninteger polyhedron vertices of the three-index axial transportation problem
- On the characterization of non-integer vertices of the relaxation polyhedron in the multi-index axial assignment problem
- Types of maximum noninteger vertices of the relaxation polyhedron of the four-index axial assignment problem
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem
Cited In (16)
- On the characterization of non-integer vertices of the relaxation polyhedron in the multi-index axial assignment problem
- Title not available (Why is that?)
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
- Characterization of the types of completely noninteger vertices of the three-index axial assignment problem polytope
- Lower bounds for the axial three-index assignment problem
- On the noninteger polyhedron vertices of the three-index axial transportation problem
- On solvability of the axial 8-index assignment problem on single-cycle permutations
- 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
- On non-integer vertices of the polytope of the three-index axial assignment problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Facets of the axial three-index assignment polytope
- On a type of maximal noninteger vertices of the polytope of the three-index axial assignment problem
- Noninteger vertices of the polytope of multi-index axial choice problem
- The number of \(r\)-fractional vertices of polytopes of three-index axial choice problem.
This page was built for publication: On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487735)