Max-min sum minimization transportation problem

DOI10.1007/s10479-006-7387-9zbMath1122.90062OpenAlexW4237857633MaRDI QIDQ2507394

Sonia Puri, Munish C. Puri

Publication date: 11 October 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10.1007/s10479-006-0056-1

zbMATH Keywords

global optimizationcombinatorial optimizationnon-convex programmingbottleneck transportation problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (1)

An iterative solution technique for capacitated two-stage time minimization transportation problem

Cites Work

• Unnamed Item
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Lexicographic bottleneck problems
• An algorithm for the bottleneck generalized assignment problem
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• A min max problem
• Improved Algorithms for Bipartite Network Flow
• A Lagrangian based branch-and-bound algorithm for production-transportation problems

This page was built for publication: Max-min sum minimization transportation problem