Chance constrained bottleneck transportation problem with preference of routes
From MaRDI portal
Recommendations
- A Stochastic Bottleneck Transportation Problem
- Stochastic bottleneck transportation problem with flexible supply and demand quantity
- scientific article; zbMATH DE number 3928728
- Fuzzy transportation problem with random transportation costs
- An extension to the single bottleneck transportation problem
Cites work
- A Stochastic Bottleneck Transportation Problem
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- An efficient primal approach to bottleneck transportation problems
- An operator theory of parametric programming for the transportation problem-I
- Approximation and contamination bounds for probabilistic programs
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 3213262 (Why is no real title available?)
- scientific article; zbMATH DE number 3069634 (Why is no real title available?)
- Improved Time Bounds for the Maximum Flow Problem
- On convex probabilistic programming with discrete distributions.
- Some remarks on the time transportation problem
- Stochastic bottleneck transportation problem with flexible supply and demand quantity
- The bottleneck transportation problem
- The Distribution of a Product from Several Sources to Numerous Localities
- The stepping stone method of explaining linear programming calculations in transportation problems
- Time‐minimizing transportation problems
Cited in
(2)
This page was built for publication: Chance constrained bottleneck transportation problem with preference of routes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915362)