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