Probabilistic Analysis of the Capacitated Transportation Problem

DOI10.1287/moor.13.1.80zbMath0653.90017MaRDI QIDQ3799791

Refael Hassin, Eitan Zemel

Publication date: 1988

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/660.pdf

zbMATH Keywords

bound; maximum flow; random capacities; capacitated transportation; constant supplies and demands; existence of a feasible solution

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

90B15: Stochastic network models in operations research

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

Related Items

Improved queue-size scaling for input-queued switches via graph factorization, An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions, A solution technique for capacitated two-level hierarchical time minimization transportation problem, Capacitated transportation problem with bounds on rim conditions, An iterative solution technique for capacitated two-stage time minimization transportation problem, Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities, CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM