Pietro Belotti, Jon Lee, et al.
Optimization Methods and Software
We consider optimization of nonlinear objective functions that balance d linear criteria over n-element independence systems presented by linear-optimization oracles. For d=1, we have previously shown that an r-best approximate solution can be found in polynomial time. Here, using an extended ErdsKoRado theorem of Frankl, we show that for d=2, finding a ρn-best solution requires exponential time. © 2011 Elsevier B.V. All rights reserved.
Pietro Belotti, Jon Lee, et al.
Optimization Methods and Software
Jon Lee, Shmuel Onn, et al.
SIAM Journal on Discrete Mathematics
Alberto Del Pia, Robert Weismantel
SODA 2014
Yael Berstein, Jon Lee, et al.
SIAM Journal on Discrete Mathematics