On the solution of discrete bottleneck problems

DOI10.1016/0166-218X(82)90052-XzbMath0489.90041MaRDI QIDQ1167061

Arie Tamir

Publication date: 1982

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

equivalent transformationbottleneck integral flow problemsdiscrete bottleneck problemssolution of problems with real valued variables

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items

Linear and combinatorial sharing problems, On combined minmax-minsum optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial Optimization with Rational Objective Functions
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
• WEIGHTED MINIMAX REAL-VALUED FLOWS
• Optimal sharing
• A good algorithm for lexicographically optimal flows in multi-terminal networks
• The Sharing Problem
• Bottleneck extrema