Publication:3673576
From MaRDI portal
zbMath0523.52001MaRDI QIDQ3673576
M. K. Kravtsov, Vladimir A. Emelichev, Michail M. Kovalev
Publication date: 1981
polyhedra; combinatorial problems; convex polyhedron; linear inequalities; polyhedral graph; transport polyhedra; permutational polyhedra
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
52A40: Inequalities and extremum problems involving convexity in convex geometry
52-02: Research exposition (monographs, survey articles) pertaining to convex and discrete geometry
52Bxx: Polytopes and polyhedra
Related Items
Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem, Multiindex transportation problems with 2-embedded structure, Parallelohedra defined by quadratic forms, On a problem of integer optimization, A new proof of a theorem of Harper on the Sperner-Erdős problem, Optimal representations of partially ordered sets and a limit Sperner theorem, Conditions of solvability of vector problems using linear convolution of criteria, Asymptotic optimality of a transport-problem plan constructed by the minimum-element method, The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations, Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems, The solution polyhedron of the dissipative inequality for relaxation SISO systems, Hyperbolic Coxeter $n$-polytopes with $n+3$ facets, Bounds on the minimum of convex functions on Euclidean combinatorial sets
