scientific article

zbMATH Open0518.90051MaRDI QIDQ3668300FDOQ3668300

V. A. Emelichev, M. K. Kravtsov

Publication date: 1981

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

zbMATH Keywords

transportation polytopealgorithmic complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (2)

• Polyhedral aspects of discrete optimization
• A proof of the maximal diameter conjecture for the transportation polyhedron

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 Q3668300)