Login / Signup

A 2-approximation for minmax regret problems via a mid-point scenario optimal solution.

Eduardo Conde
Published in: Oper. Res. Lett. (2010)
Keyphrases
  • optimal solution
  • minmax regret
  • interval data
  • objective function
  • linear programming
  • knapsack problem
  • resource allocation problems
  • unsupervised learning
  • approximate solutions