CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM
DOI10.1142/S021759591000279XzbMath1197.90079OpenAlexW1969518543MaRDI QIDQ3052717
Kalpana Dahiya, Vikas Kumar Sharma, Vanita Verma
Publication date: 1 November 2010
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021759591000279x
combinatorial optimizationnon-convex programmingcapacitated transportation problembottleneck linear programmingtime transportation problem
Nonconvex programming, global optimization (90C26) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (8)
Cites Work
- Capacitated transportation problem with bounds on rim conditions
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- An algorithm for the bottleneck generalized assignment problem
- Two level hierarchical time minimizing transportation problem
- Algorithms for the minimax transportation problem
- Probabilistic Analysis of the Capacitated Transportation Problem
- On lexicographic optimal solutions in transportation problems
- The bottleneck transportation problem
- Unnamed Item
This page was built for publication: CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM