A solution technique for capacitated two-level hierarchical time minimization transportation problem
From MaRDI portal
Publication:6164324
DOI10.1016/j.cor.2022.106125MaRDI QIDQ6164324
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
transportationiteration algorithmbinary searchnetwork with lower and upper arc capacitiestime minimization
Cites Work
- Unnamed Item
- Unnamed Item
- An iterative algorithm for two level hierarchical time minimization transportation problem
- Capacitated transportation problem with bounds on rim conditions
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Lexicographic bottleneck problems
- A procedure for time minimization transportation problem
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- Solving fixed charge transportation problem with truck load constraint using metaheuristics
- Two level hierarchical time minimizing transportation problem
- A strongly polynomial algorithm for the transportation problem
- Scale space and variational methods in computer vision. 4th international conference, SSVM 2013, Schloss Seggau, Leibnitz, Austria, June 2--6, 2013. Proceedings
- An alternate approach to solve two-level priority based assignment problem
- A priority based assignment problem
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- An improved algorithm for two stage time minimization assignment problem
- Mathematical Methods of Organizing and Planning Production
- Algorithms for the minimax transportation problem
- CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM
- Probabilistic Analysis of the Capacitated Transportation Problem
- A min max problem
- On lexicographic optimal solutions in transportation problems
- Some remarks on the time transportation problem
- Mass transportation problems with capacity constraints
- An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Time‐minimizing transportation problems
- A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
- A Lagrangian based branch-and-bound algorithm for production-transportation problems
