scientific article; zbMATH DE number 3828715
From MaRDI portal
Publication:3673577
combinatorial problemsconvex polyhedronlinear inequalitiespermutational polyhedrapolyhedrapolyhedral graphtransport polyhedra
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Recommendations
- scientific article; zbMATH DE number 3915102
- Algebraic techniques in graph theory and optimization. Transl. from the Russian
- scientific article; zbMATH DE number 3905351
- Convex Polyhedra
- scientific article; zbMATH DE number 702975
- scientific article; zbMATH DE number 3828714
- Geometry and topology. Transl. from the Russian
- scientific article; zbMATH DE number 919758
- Combinatorics and graph theory. Part I. Transl. from the Russian
Cited in
(62)- The k-assignment polytope
- Convex integer maximization via Graver bases
- Clique facets of the axial and planar assignment polytopes
- Graphs of transportation polytopes
- Conditions for the existence of solutions of the three-dimensional planar transportation problem
- Determining a matroid polytope by non-Radon partitions
- On the extremal points of a class of polytopes of matrices
- Row-stochastic matrices with a common left fixed vector
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem
- A characterization of the uncapacitated network design polytope
- Convex hulls of orbits of representations of finite groups and combinatorial optimization
- The geometry of products of minors
- Matrix majorization
- Simple vertices of maximal minor polytopes
- Multidimensional medians arising from geodesics on graphs
- On the number of faces of certain transportation polytopes
- Partial monotonizations of Hamiltonian cycle polytopes: Dimensions and diameters
- The hierarchy of circuit diameters and transportation polytopes
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- Majorization-constrained doubly stochastic matrices
- Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron
- Continuous control of chaos
- Cyclic polytopes and oriented matroids
- On the circuit diameter conjecture
- A two-step method for solving vector optimization problems on permutation configuration
- A note on the approximability of deepest-descent circuit steps
- Hardness results for multimarginal optimal transport problems
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation
- Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards
- Fractional perfect \(b\)-matching polytopes. I: General theory
- On the vertices of the d-dimensional Birkhoff polytope
- Polyhedral combinatorics of multi-index axial transportation problems
- Permutohedra and minimal matrices
- Lower bounds for contingency tables via Lorentzian polynomials
- Distributed averaging with linear objective maps
- All-integer column generation for set partitioning: basic principles and extensions
- On integer programming with bounded determinants
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- scientific article; zbMATH DE number 3510328 (Why is no real title available?)
- Exact and asymptotic results on coarse Ricci curvature of graphs
- Lower bounds for the number of hyperplanes separating two finite sets of points
- Mathematical model for solving operational problem of regional cargo transportation
- Continuous extensions on Euclidean combinatorial configurations
- Factorized mutual information maximization.
- Principal majorization ideals and optimization
- 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
- Sparse interpolation of symmetric polynomials
- Totally symmetric self-complementary plane partition matrices and related polytopes
- On the diameter of a 2-sum of polyhedra
- k-sample inference via multimarginal optimal transport
- Combinatorics of generalized parking-function polytopes
- A generating function for all semi-magic squares and the volume of the Birkhoff polytope
- A survey for the quadratic assignment problem
- Permutation polytopes and indecomposable elements in permutation groups
- Transportation matrices with staircase patterns and majorization
- Column generation in the integral simplex method
- \(N\)-fold integer programming
- Majorization permutahedra and (0,1)-matrices
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
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)
