A polynomial algorithm for a two-stage time minimizing transportation problem.

DOI10.1007/BF03399188zbMath1278.90260OpenAlexW2781424634MaRDI QIDQ2467864

Rita Malhotra, Sonia Singh

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03399188

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (4)

Index-Matrix Interpretation of a Two-Stage Three-Dimensional Intuitionistic Fuzzy Transportation Problem ⋮ Solving Two Stage Transportation Problems ⋮ An iterative solution technique for capacitated two-stage time minimization transportation problem ⋮ A New Interval-Valued Intuitionistic Fuzzy Numbers: Ranking Methodology and Application

Cites Work

• Unnamed Item
• On minimizing the duration of transportation
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• An algorithm for the bottleneck generalized assignment problem
• Algorithms for the minimax transportation problem
• On three basic methods for solving bottleneck transportation problems
• A min max problem
• Generalized Bottleneck Problems^∗
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Time‐minimizing transportation problems

This page was built for publication: A polynomial algorithm for a two-stage time minimizing transportation problem.