Solving Bottleneck Bi-criteria Transportation Problems

DOI10.1007/978-3-642-28926-2_13zbMath1494.90049OpenAlexW195378258MaRDI QIDQ5867214

D. Anuradha, P. Pandian

Publication date: 13 September 2022

Published in: Mathematical Modelling and Scientific Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28926-2_13

zbMATH Keywords

efficient solutionscompromise solutionsblock-dripping methodbottleneck bi-criteria transportation problem

Mathematics Subject Classification ID

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

Cites Work

• The multiobjective bottleneck transportation problem.
• Bicriteria Transportation Problem
• Technical Note—Cost/Completion-Date Tradeoffs in the Transportation Problem
• Some remarks on the time transportation problem
• Total time minimizing transportation problem
• Time‐minimizing transportation problems
• The bottleneck transportation problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving Bottleneck Bi-criteria Transportation Problems