On the complexity of minmax regret linear programming

A new polynomial-time algorithm for linear programming

Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations

Natural Sciences, Computer Science, Algorithms +12

Polynomial algorithms in linear programming

Leonid Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1980 · 2K citations

Computing, Computer Science, Mathematics +10

The complexity of satisfiability problems

Thomas J. Schaefer · 1978 · 1.8K citations · Full text

Computing, Computer Science, Algorithms +12

Minimax regret solution to linear programming problems with an interval objective function

Masahiro Inuiguchi, Masatoshi Sakawa · European Journal of Operational Research · 1995 · 213 citations

Natural Sciences, Decision Sciences, Mathematics +14

On the complexity of a class of combinatorial optimization problems with uncertainty

Igor Averbakh · Mathematical Programming · 2001 · 168 citations

Natural Sciences, Computer Science, Mathematics +12