Jon Lee
IBM J. Res. Dev
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.
Jon Lee
IBM J. Res. Dev
Y. Berstein, Jon Lee, et al.
Mathematical Programming
Alberto Del Pia, Robert Weismantel
SODA 2014
Anureet Saxena, Pierre Bonami, et al.
Mathematical Programming