scientific article; zbMATH DE number 3828715

zbMATH Open0523.52002MaRDI QIDQ3673577FDOQ3673577

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

Publication date: 1984

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

zbMATH Keywords

polyhedralinear inequalitiescombinatorial problemsconvex polyhedronpolyhedral graphtransport polyhedrapermutational polyhedra

Mathematics Subject Classification ID

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

Cited In (58)

• Determining a matroid polytope by non-Radon partitions
• A generating function for all semi-magic squares and the volume of the Birkhoff polytope
• On the circuit diameter conjecture
• Permutation polytopes and indecomposable elements in permutation groups
• Principal majorization ideals and optimization
• Majorization permutahedra and (0,1)-matrices
• On the diameter of partition polytopes and vertex-disjoint cycle cover
• Convex hulls of orbits of representations of finite groups and combinatorial optimization
• \(N\)-fold integer programming
• The diameters of network-flow polytopes satisfy the Hirsch conjecture
• Multidimensional medians arising from geodesics on graphs
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation
• Distributed averaging with linear objective maps
• Majorization-constrained doubly stochastic matrices
• All-integer column generation for set partitioning: basic principles and extensions
• A survey for the quadratic assignment problem
• Cyclic polytopes and oriented matroids
• On integer programming with bounded determinants
• On the vertices of the \(d\)-dimensional Birkhoff polytope
• The \(k\)-assignment polytope
• Column generation in the integral simplex method
• Graphs of transportation polytopes
• Row-stochastic matrices with a common left fixed vector
• The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties
• A two-step method for solving vector optimization problems on permutation configuration
• Polyhedral combinatorics of multi-index axial transportation problems
• Conditions for the existence of solutions of the three-dimensional planar transportation problem
• Fractional perfect \(b\)-matching polytopes. I: General theory
• On the number of faces of certain transportation polytopes
• Matrix majorization
• Simple vertices of maximal minor polytopes
• A note on the approximability of deepest-descent circuit steps
• A characterization of the uncapacitated network design polytope
• Clique facets of the axial and planar assignment polytopes
• Exact and asymptotic results on coarse Ricci curvature of graphs
• Hardness results for multimarginal optimal transport problems
• Lower bounds for the number of hyperplanes separating two finite sets of points
• Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards
• Polynomial-time primal simplex algorithms for the minimum cost network flow problem
• Projections and angle sums of belt polytopes and permutohedra
• Sparse interpolation of symmetric polynomials
• On the extremal points of a class of polytopes of matrices
• Permutohedra and minimal matrices
• The geometry of products of minors
• Convex integer maximization via Graver bases
• Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
• The hierarchy of circuit diameters and transportation polytopes
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters
• Mathematical Model for Solving Operational Problem of Regional Cargo Transportation
• Continuous control of chaos
• Transportation matrices with staircase patterns and majorization
• Title not available (Why is that?)
• Factorized mutual information maximization
• On the Combinatorial Diameters of Parallel and Series Connections
• Title not available (Why is that?)
• Lower bounds for contingency tables via Lorentzian polynomials
• The polyhedral-surface cutting plane method of optimization over a vertex-located set

   Recommendations

• Title not available (Why is that?) 👍 👎
• Algebraic techniques in graph theory and optimization. Transl. from the Russian 👍 👎
• Title not available (Why is that?) 👍 👎
• Convex Polyhedra 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Geometry and topology. Transl. from the Russian 👍 👎
• Title not available (Why is that?) 👍 👎
• Combinatorics and graph theory. Part I. Transl. from the Russian 👍 👎

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