Multi-index fixed charge bi-criterion transshipment problem
From MaRDI portal
Publication:505158
DOI10.1007/s12597-012-0108-zzbMath1353.90026OpenAlexW2081131132MaRDI QIDQ505158
Publication date: 19 January 2017
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-012-0108-z
linear programmingtransportation problemthree-dimensionalcost-time trade off pairstransshipment problem
Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time minimizing transshipment problem
- The Transhipment Problem
- New Methods in Mathematical Programming—The Solid Transportation Problem
- A Variant of the Transportation Problem in Which the Constraints are of Mixed Type
- Solving Constrained Transportation Problems
- An algorithm for the optimum time-cost trade-off in fixed-charge bi-criterion transportation problem bi-criterion transportation problem
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- Three dimensional fixed charge bi-criterion indefinite quadratic transportation problem
- The Multi-Index Problem
- The sum of a linear and a linear fractional transportation problem with restricted and enhanced flow
- Multi index fixed charge bicriterion transportation problem
This page was built for publication: Multi-index fixed charge bi-criterion transshipment problem