Probabilistic Analysis of the Capacitated Transportation Problem

DOI10.1287/MOOR.13.1.80MaRDI QIDQ3799791zbMATH OpenOpenAlexFDO

Authors 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

boundcapacitated transportationconstant supplies and demandsexistence of a feasible solutionmaximum flowrandom capacities

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic network models in operations research (90B15) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)

Recommendations

• Probabilistic Analysis of Network Flow Algorithms
• Probabilistic analysis of a capactiated vehicle routing problem—I
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• scientific article; zbMATH DE number 232274
• A capacitated stochastic linear transshipment problem with prohibited routes

Cited in

(20)

• Staircase transportation problems with superadditive rewards and cumulative capacities
• A capacitated stochastic linear transshipment problem with prohibited routes
• Transportation outsourcing problems considering feasible probabilities under stochastic demands
• 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
• Capacitated stochastic transshipment problem with prohibited routes
• scientific article; zbMATH DE number 3950168 (Why is no real title available?)
• Probabilistic analysis of a capactiated vehicle routing problem—I
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• Bounding a Probability Measure Over a Polymatroid with an Application to Transportation Problems
• Probabilistic Analysis of Network Flow Algorithms
• scientific article; zbMATH DE number 903398 (Why is no real title available?)
• 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
• Methods for verifying booked capacities
• A solution technique for capacitated two-level hierarchical time minimization transportation problem
• An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified
• Sustainable multi-objective fixed charge capacitated transportation model: a case study in steel industry
• Capacitated transportation problem with bounds on rim conditions

This page was built for publication: Probabilistic Analysis of the Capacitated Transportation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799791)