A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
From MaRDI portal
Publication:1652389
DOI10.1016/j.cor.2017.05.003zbMath1391.90104OpenAlexW2610694269MaRDI QIDQ1652389
Muhammad Munir Butt, Zuoan Li, Fanrong Xie
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.05.003
transportationpolynomial algorithmtransportation problemhierarchical optimizationnetwork with lower and upper arc capacities
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Task preference-based bottleneck assignment problem ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ An Iterative Solution Technique to Minimize the Average Transportation Cost of Capacitated Transportation Problem with Bounds on Rim Conditions ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ Extension of particle swarm optimization algorithm for solving two-level time minimization transportation problem ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ An alternate approach to solve two-level priority based assignment problem
Cites Work
- A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
- An iterative algorithm for two level hierarchical time minimization transportation problem
- On lower bounds for the fixed charge problem
- Capacitated transportation problem with bounds on rim conditions
- On minimizing the duration of transportation
- Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
- Lexicographic bottleneck problems
- A procedure for time minimization transportation problem
- An algorithm for the bottleneck generalized assignment problem
- A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
- A new dual based procedure for the transportation problem
- Two level hierarchical time minimizing transportation problem
- A strongly polynomial algorithm for the transportation problem
- Solving a transportation problem with mixed constraints and a specified transportation flow
- Scale space and variational methods in computer vision. 4th international conference, SSVM 2013, Schloss Seggau, Leibnitz, Austria, June 2--6, 2013. Proceedings
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- Mathematical Methods of Organizing and Planning Production
- On a Class of Capacitated Transportation Problems
- Algorithms for the minimax transportation problem
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A min max problem
- A Variant of the Transportation Problem in Which the Constraints are of Mixed Type
- Bottleneck Linear Programming
- On lexicographic optimal solutions in transportation problems
- Some remarks on the time transportation problem
- The Transportation Problem with Mixed Constraints
- Mass transportation problems with capacity constraints
- Time‐minimizing transportation problems
- The Transportation Problem and its Variants
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- The bottleneck transportation problem
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
