Publication:4915362
From MaRDI portal
zbMath1269.90125MaRDI QIDQ4915362
Yue Ge, Minghao Chen, Hiroaki Ishii
Publication date: 10 April 2013
Full work available at URL: http://www.kybernetika.cz/content/2012/5/958
non-domination; chance constraint; bottleneck transportation; random transportation time; preference of routes
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C15: Stochastic programming
90C70: Fuzzy and other nonstochastic uncertainty mathematical programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On convex probabilistic programming with discrete distributions.
- Approximation and contamination bounds for probabilistic programs
- The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
- An operator theory of parametric programming for the transportation problem-I
- An efficient primal approach to bottleneck transportation problems
- Improved Time Bounds for the Maximum Flow Problem
- Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems
- A Stochastic Bottleneck Transportation Problem
- Some remarks on the time transportation problem
- Time‐minimizing transportation problems
- The bottleneck transportation problem
- The Distribution of a Product from Several Sources to Numerous Localities