On the solution of discrete bottleneck problems

DOI10.1016/0166-218X(82)90052-XMaRDI QIDQ1167061zbMATH OpenFDO

Authors Arie Tamir

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/0166-218X(82)90052-X

zbMATH Keywords

bottleneck integral flow problemsdiscrete bottleneck problemsequivalent transformationsolution of problems with real valued variables

Mathematics Subject Classification ID

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

Cites work

• A good algorithm for lexicographically optimal flows in multi-terminal networks
• Bottleneck extrema
• Combinatorial Optimization with Rational Objective Functions
• FINDING THE WEIGHTED MINIMAX FLOW IN A POLYNOMIAL TIME
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3634041 (Why is no real title available?)
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Optimal sharing
• The Sharing Problem
• WEIGHTED MINIMAX REAL-VALUED FLOWS

Cited in

(2)

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

This page was built for publication: On the solution of discrete bottleneck problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1167061)