Transportation polytopes
From MaRDI portal
Publication:2553902
Cited in
(14)- Extreme points of certain transportation polytopes with fixed total sums
- Degeneracy in transportation problems
- The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices
- The extreme points of centrosymmetric transportation polytopes
- Primal transportation and transshipment algorithms
- Combinatoric classes of the transportation problem and their properties
- Polyhedral combinatorics of multi-index axial transportation problems
- Symmetric and Hankel-symmetric transportation polytopes
- Perron eigenvectors and the symmetric transportation polytope
- A conjecture of E. D. Bolker
- Signature classes of transportation polytopes
- A privacy-preserving method to optimize distributed resource allocation
- Partitions of the polytope of doubly substochastic matrices
- Plethysm and lattice point counting
This page was built for publication: Transportation polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553902)