A subexponential bound for linear programming
Algorithmica1996Vol. 16(4-5), pp. 498–516
Citations Over TimeTop 10% of 1996 papers
Related Papers
- → Lexicographical order, lexicographical index, and linear operators(1990)10 cited
- → A note on approximation of a ball by polytopes(2004)6 cited
- → Lexicographic aggregation of semiorders(1992)14 cited
- Continuous Lexicographic Preferences(2003)
- → On the Lexicographic Centre of Multiple Objective Optimization(2015)