scientific article; zbMATH DE number 3614495

MaRDI QIDQ4178776zbMATH OpenFDO

Authors M. K. Kravtsov, N. D. Averbukh, V. A. Emelichev

Publication date 1976

zbMATH Keywords

linear programmingtransportation polyhedronmaximal number of vertices

Mathematics Subject Classification ID

Inequalities and extremum problems involving convexity in convex geometry (52A40) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 3861931
• scientific article; zbMATH DE number 1294379
• scientific article; zbMATH DE number 3949176
• Multi-index plane transportation polytopes with maximum number of vertices
• Multi-index planar transportation polytopes with maximum number of vertices
• scientific article; zbMATH DE number 3883948
• On the number of faces of certain transportation polytopes
• A proof of the maximal diameter conjecture for the transportation polyhedron
• A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
• Graphs of transportation polytopes

Cited in

(5)

• Adjacent Extreme Points Of A Transportation Polytope
• Multi-index planar transportation polytopes with maximum number of vertices
• On the number of faces of certain transportation polytopes
• scientific article; zbMATH DE number 3848970 (Why is no real title available?)
• A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178776)