On the noninteger polyhedron vertices of the three-index axial transportation problem

DOI10.1023/B:AURC.0000019374.29519.C2zbMATH Open1074.90002OpenAlexW2067004918MaRDI QIDQ2487736FDOQ2487736

E. V. Lukshin, M. K. 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.0000019374.29519.c2

zbMATH Keywords

transportation polyhedron

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cited In (10)

• On the maximum noninteger polyhedron vertices of the three-index axial assignment problem
• Title not available (Why is that?)
• 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
• 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
• Title not available (Why is that?)
• A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
• Noninteger vertices of the polytope of multi-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)