Sign in

Lower Bounds for the Smoothed Number of Pareto Optimal Solutions.

Tobias BrunschHeiko Röglin
Published in: TAMC (2011)
Keyphrases
  • lower bound
  • multi objective
  • upper bound
  • computational complexity