OP-00392 Open A strongly polynomial pivot rule for the simplex method OC · AIM Open Applied Problems · linear programming · pivot rules · simplex method
OP-00406 Open The factor-two integrality gap for asymmetric metric routing OC · AIM Open Applied Problems · integrality gaps · linear programming relaxations · traveling salesman problem
OP-00453 Open The four-thirds integrality gap for metric routing CO · AIM Open Applied Problems · integrality gaps · linear programming relaxations · traveling salesman problem
OP-00501 Open The optimal asymptotic rate of binary error-correcting codes IT · AIM Open Applied Problems · error-correcting codes · Gilbert–Varshamov bound · linear programming bounds