scientific article; zbMATH DE number 3614495

zbMATH Open0395.90049MaRDI QIDQ4178776

N. D. Averbukh, M. K. Kravtsov, Vladimir Emelichev

Publication date: 1976

Title of this publication is not available (Why is that?)

zbMATH Keywords

linear programmingtransportation polyhedronmaximal number of vertices

Mathematics Subject Classification ID

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

Related Items (4)

Title not available (Why is that?) ⋮ Multi-index planar transportation polytopes with maximum number of vertices ⋮ Adjacent Extreme Points Of A Transportation Polytope ⋮ On the number of faces of certain transportation polytopes

Recommendations

• Graphs of transportation polytopes 👍 👎
• On the number of faces of certain transportation polytopes 👍 👎
• A proof of the maximal diameter conjecture for the transportation polyhedron 👍 👎
• Multi-index planar transportation polytopes with maximum number of vertices 👍 👎
• A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)