Publication:3673576
From MaRDI portal
zbMath0523.52001MaRDI QIDQ3673576
M. K. Kravtsov, Michail M. Kovalev, Vladimir A. Emelichev
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
Unnamed Item, Unnamed Item, Symmetric Polyhedra with Rhombic Vertices, Unnamed Item, On multi-symmetric functions and transportation polytopes, Unnamed Item, Convex polyhedra with deltoidal vertices, On facet-inducing inequalities for combinatorial polytopes, Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem, Influence of certain transpositions on the cyclic structure of permutations, Multidimensional triangle-truncated simplexes, Multiindex transportation problems with 2-embedded structure, Parallelohedra defined by quadratic forms, Continuous representations and functional extensions in combinatorial optimization, Multi-index transportation problems with 1-nested structure, The method of artificial space dilation in problems of optimal packing of geometric objects, A special case of resolving polynomials, 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, Development of hypergraph theory, Convex polyhedra of distributions preserved by operations over a finite field, On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation, Properties of combinatorial optimization problems over polyhedral-spherical sets, Conditions of solvability of vector problems using linear convolution of criteria, Asymptotic optimality of a transport-problem plan constructed by the minimum-element method, Theory and methods of Euclidian combinatorial optimization: current status and prospects, Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations, The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations, FPT-algorithm for computing the width of a simplex given by a convex hull, Special transpositions of permutation elements and properties of their composition, 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, On the polytope faces of the graph approximation problem, Hyperbolic Coxeter $n$-polytopes with $n+3$ facets, Bounds on the minimum of convex functions on Euclidean combinatorial sets
