Reshipments and overshipments in transportation problems with minimax objective

DOI10.1007/BF01720146zbMath0751.90049OpenAlexW2000729088MaRDI QIDQ1182137

H. A. Eiselt, Rainer E. Burkard

Publication date: 27 June 1992

Published in: OR Spektrum (Search for Journal in Brave)

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

zbMATH Keywords

minimax flow transportation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Perspectives of Monge properties in optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimax linear programming problem
• Linear and combinatorial sharing problems
• Lexicographic bottleneck problems
• The more-for-less paradox in linear programming
• Algorithms for the minimax transportation problem
• Minimizing Overshipments In Bottleneck Transportation Problems
• Sharing problems
• Fast Algorithms for Bipartite Network Flow
• WEIGHTED MINIMAX REAL-VALUED FLOWS
• Optimal sharing
• Transportation problems with somexij negative and transshipment problems
• The Knapsack Sharing Problem
• The flow circulation sharing problem
• Application of Programs with Maximin Objective Functions to Problems of Optimal Resource Allocation
• The transportation paradox
• The Transportation Problem and its Variants

This page was built for publication: Reshipments and overshipments in transportation problems with minimax objective