Transportation polytopes
From MaRDI portal
Publication:2553902
DOI10.1016/0095-8956(72)90060-3zbMath0241.90033OpenAlexW4210706564MaRDI QIDQ2553902
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90060-3
Related Items (14)
Degeneracy in transportation problems ⋮ Symmetric and Hankel-symmetric transportation polytopes ⋮ Unnamed Item ⋮ A conjecture of E. D. Bolker ⋮ A Privacy-Preserving Method to Optimize Distributed Resource Allocation ⋮ The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices ⋮ Partitions of the polytope of doubly substochastic matrices ⋮ Perron eigenvectors and the symmetric transportation polytope ⋮ The extreme points of centrosymmetric transportation polytopes ⋮ Plethysm and lattice point counting ⋮ Signature classes of transportation polytopes ⋮ Polyhedral combinatorics of multi-index axial transportation problems ⋮ Primal transportation and transshipment algorithms ⋮ Combinatoric classes of the transportation problem and their properties
Cites Work
This page was built for publication: Transportation polytopes
