scientific article

zbMath0523.52001MaRDI QIDQ3673576

M. K. Kravtsov, Michail M. Kovalev, Vladimir A. Emelichev

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

polyhedra combinatorial problems convex polyhedron linear inequalities polyhedral graph transport polyhedra permutational polyhedra

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Polytopes and polyhedra (52Bxx)

Related Items (38)

Influence of certain transpositions on the cyclic structure of permutations ⋮ Special transpositions of permutation elements and properties of their composition ⋮ Multidimensional triangle-truncated simplexes ⋮ Development of hypergraph theory ⋮ On multi-symmetric functions and transportation polytopes ⋮ On the polytope faces of the graph approximation problem ⋮ Optimal representations of partially ordered sets and a limit Sperner theorem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounds on the minimum of convex functions on Euclidean combinatorial sets ⋮ Unnamed Item ⋮ Multiindex transportation problems with 2-embedded structure ⋮ Convex polyhedra with deltoidal vertices ⋮ A special case of resolving polynomials ⋮ Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem ⋮ Convex polyhedra of distributions preserved by operations over a finite field ⋮ On facet-inducing inequalities for combinatorial polytopes ⋮ 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 ⋮ On a problem of integer optimization ⋮ Conditions of solvability of vector problems using linear convolution of criteria ⋮ Asymptotic optimality of a transport-problem plan constructed by the minimum-element method ⋮ Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems ⋮ Parallelohedra defined by quadratic forms ⋮ 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 ⋮ 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 ⋮ Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem ⋮ The method of cutting the vertices of permutation polyhedron graph to solve linear conditional optimization problems on permutations ⋮ Symmetric Polyhedra with Rhombic Vertices ⋮ Hyperbolic Coxeter $n$-polytopes with $n+3$ facets ⋮ FPT-algorithm for computing the width of a simplex given by a convex hull ⋮ The solution polyhedron of the dissipative inequality for relaxation SISO systems ⋮ Unnamed Item ⋮ Numerical assessment of the informational influence of election campaigns on the electorate ⋮ A new proof of a theorem of Harper on the Sperner-Erdős problem

This page was built for publication: