On lexicographic optimal solutions in transportation problems
From MaRDI portal
Publication:4340165
DOI10.1080/02331939708844292zbMath0872.90061OpenAlexW2014248335MaRDI QIDQ4340165
No author found.
Publication date: 16 June 1997
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939708844292
Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (7)
An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM ⋮ A priority based time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ The multiple objective time transportation problem with additional restrictions
Cites Work
- Time-cost tradeoff in a three-dimensional assignment problem
- On minimizing the duration of transportation
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Lexicographic bottleneck problems
- An algorithm for the bottleneck generalized assignment problem
- Algorithms for the minimax transportation problem
- A Variant of the Transportation Problem in Which the Constraints are of Mixed Type
- Some remarks on the time transportation problem
- The Transportation Problem with Mixed Constraints
- The Transportation Problem and its Variants
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- The bottleneck transportation problem
This page was built for publication: On lexicographic optimal solutions in transportation problems
