Combinatorics and Geometry of Transportation Polytopes: An Update
From MaRDI portal
Publication:3464532
zbMath1360.90169arXiv1307.0124MaRDI QIDQ3464532
Edward D. Kim, Jesús A. De Loera
Publication date: 27 January 2016
Full work available at URL: https://arxiv.org/abs/1307.0124
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorics and topology in relation with holomorphic dynamical systems (37F20)
Related Items (28)
On the diameter of cut polytopes ⋮ The Eulerian transformation ⋮ On the closest point to the origin in transportation polytopes ⋮ Quadratic diameter bounds for dual network flow polyhedra ⋮ On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond ⋮ Wasserstein Barycenters Are NP-Hard to Compute ⋮ On multi-symmetric functions and transportation polytopes ⋮ Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards ⋮ The value function of a transportation problem ⋮ Sign matrix polytopes from Young tableaux ⋮ Unnamed Item ⋮ Tropical medians by transportation ⋮ Optimal nonparametric testing of missing completely at random and its connections to compatibility ⋮ 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 ⋮ Phase transition in random contingency tables with non-uniform margins ⋮ On Dantzig figures from graded lexicographic orders ⋮ Plethysm and lattice point counting ⋮ Geometry of discrete copulas ⋮ Supercharacter theories of type \(A\) unipotent radicals and unipotent polytopes ⋮ Supercharacter theories of type \(A\) unipotent radicals and unipotent polytopes ⋮ Pattern-avoiding polytopes ⋮ The diameters of network-flow polytopes satisfy the Hirsch conjecture ⋮ Coupling matrix manifolds assisted optimization for optimal transport problems ⋮ Good Clusterings Have Large Volume ⋮ Hardness results for multimarginal optimal transport problems ⋮ Information-geometric equivalence of transportation polytopes
This page was built for publication: Combinatorics and Geometry of Transportation Polytopes: An Update
