A priority based time minimization transportation problem
From MaRDI portal
Publication:4987785
Recommendations
Cites work
- A min max problem
- A priority based assignment problem
- Algorithms for the minimax transportation problem
- An algorithm for the bottleneck generalized assignment problem
- An iterative algorithm for two level hierarchical time minimization transportation problem
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- scientific article; zbMATH DE number 4047438 (Why is no real title available?)
- scientific article; zbMATH DE number 3222521 (Why is no real title available?)
- Lexicographic bottleneck problems
- Linear bottleneck transportation problems
- On lexicographic optimal solutions in transportation problems
- On minimizing the duration of transportation
- The bottleneck transportation problem
- Time‐minimizing transportation problems
- Total time minimizing transportation problem
- Two level hierarchical time minimizing transportation problem
Cited in
(7)- Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem
- scientific article; zbMATH DE number 3867062 (Why is no real title available?)
- scientific article; zbMATH DE number 3982911 (Why is no real title available?)
- The multi-objective multi-item just-in-time transportation problem
- The p-median problem with upgrading of transportation costs and minimum travel time allocation
- Two-phase time minimization transportation problem with the restricted flow
- The timetable constrained distance minimization problem
This page was built for publication: A priority based time minimization transportation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987785)