Bottleneck linear programming
From MaRDI portal
Publication:4117598
DOI10.1007/BF01580397zbMath0347.90057MaRDI QIDQ4117598
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)
Related Items (7)
Duality for algebraic linear programming ⋮ Discrete extremal problems ⋮ On the bottleneck linear programming problem ⋮ Duality and admissible transformations in combinatorial optimization ⋮ An algorithm for the bottleneck generalized assignment problem ⋮ The stochastic bottleneck linear programming problem ⋮ Selected bibliography on degeneracy
Cites Work
- The m-Center Problem: Minimax Facility Location
- Some remarks on the time transportation problem
- The Composite Simplex Algorithm
- Optimal Political Districting by Implicit Enumeration Techniques
- Time‐minimizing transportation problems
- Bottleneck extrema
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- Matroids and the greedy algorithm
- The bottleneck transportation problem
This page was built for publication: Bottleneck linear programming