Bottleneck linear programming

DOI10.1007/BF01580397MaRDI QIDQ4117598zbMATH OpenFDO

Authors Robert Garfinkel, Mendu Rao

Publication date 1977

Published in Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Integer programming (90C10)

Cites work

• Bottleneck extrema
• Matroids and the greedy algorithm
• Optimal Political Districting by Implicit Enumeration Techniques
• Some remarks on the time transportation problem
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• The m-Center Problem: Minimax Facility Location
• The Composite Simplex Algorithm
• The bottleneck transportation problem
• Time‐minimizing transportation problems

Cited in

(7)

• On the bottleneck linear programming problem
• Discrete extremal problems
• The stochastic bottleneck linear programming problem
• An algorithm for the bottleneck generalized assignment problem
• Selected bibliography on degeneracy
• Duality for algebraic linear programming
• Duality and admissible transformations in combinatorial optimization

This page was built for publication: Bottleneck linear programming

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