Algorithms for the minimax transportation problem
From MaRDI portal
Publication:3026747
DOI10.1002/nav.3800330415zbMath0624.90066OpenAlexW2053856707MaRDI QIDQ3026747
Publication date: 1986
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800330415
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items (20)
Minimax linear programming problem ⋮ On combined minmax-minsum optimization ⋮ 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 ⋮ Optimizing time–cost trade-off decisions in an interval transportation problem with multiple shipment options ⋮ On bilevel fractional programming ⋮ Optimal design of line replaceable units ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ On lexicographic optimal solutions in transportation problems ⋮ Bi-criteria transportation problem with multiple parameters ⋮ Reshipments and overshipments in transportation problems with minimax objective ⋮ A polynomial algorithm for a two-stage time minimizing transportation problem. ⋮ The linear balancing flow problem ⋮ Bilevel time minimizing transportation problem ⋮ CAPACITATED TWO-STAGE TIME MINIMIZATION TRANSPORTATION PROBLEM ⋮ A computational study of minimax flow centers in trees ⋮ The balanced linear programming problem ⋮ A priority based time minimization transportation problem ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ Shipment in a multi-choice environment: a case study of shipping carriers in US
Cites Work
This page was built for publication: Algorithms for the minimax transportation problem
