Transportation polytopes

DOI10.1016/0095-8956(72)90060-3zbMATH Open0241.90033OpenAlexW4210706564MaRDI QIDQ2553902FDOQ2553902

Authors: Ethan D. Bolker 

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

Mathematics Subject Classification ID

Linear programming (90C05) Designs and configurations (05B99)

Cites Work

• Title not available (Why is that?)

Cited In (14)

• The minimum completions and covers of symmetric, Hankel symmetric, and centrosymmetric doubly substochastic matrices
• Partitions of the polytope of doubly substochastic matrices
• Signature classes of transportation polytopes
• A conjecture of E. D. Bolker
• Primal transportation and transshipment algorithms
• Combinatoric classes of the transportation problem and their properties
• Polyhedral combinatorics of multi-index axial transportation problems
• A privacy-preserving method to optimize distributed resource allocation
• Perron eigenvectors and the symmetric transportation polytope
• Extreme points of certain transportation polytopes with fixed total sums
• Symmetric and Hankel-symmetric transportation polytopes
• The extreme points of centrosymmetric transportation polytopes
• Plethysm and lattice point counting
• Degeneracy in transportation problems

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)