On the noninteger polyhedron vertices of the three-index axial transportation problem
From MaRDI portal
Publication:2487736
Recommendations
- scientific article; zbMATH DE number 2067045
- On non-integer vertices of the polytope of the three-index axial assignment problem
- Noninteger vertices of the polytope of multi-index axial choice problem
- On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
- On a type of maximal noninteger vertices of the polytope of the three-index axial assignment problem
Cited in
(14)- On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
- scientific article; zbMATH DE number 3854809 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2067045 (Why is no real title available?)
- An axial four-index transportation problem and its algebraic characterizations
- Transportation problems and simplicial polytopes that are not weakly vertex-decomposable
- Polyhedral combinatorics of multi-index axial transportation problems
- scientific article; zbMATH DE number 2195325 (Why is no real title available?)
- On the dimension of polytopes of planar three-index transportation problems
- A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
- On some properties of three-index transportation polytopes
- 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 noninteger polyhedron vertices of the three-index axial transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487736)
