Loading…
Mixing convex-optimization bounds for maximum-entropy sampling
Chen, Zhongzhu, Fampa, Marcia, Lambert, Amélie, Lee, Jon
Published in Mathematical programming (01.08.2021)
Published in Mathematical programming (01.08.2021)
Get full text
Journal Article
Loading…
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems
Anstreicher, Kurt M., Fampa, Marcia, Lee, Jon, Williams, Joy
Published in Mathematical programming (01.06.1999)
Published in Mathematical programming (01.06.1999)
Get full text
Journal Article
Loading…
Loading…
Loading…
Loading…
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath, Sviridenko, Maxim
Published in SIAM journal on discrete mathematics (01.01.2010)
Published in SIAM journal on discrete mathematics (01.01.2010)
Get full text
Journal Article
Loading…
Loading…
Loading…
Non-monotone submodular maximization under matroid and knapsack constraints
Lee, Jon, Mirrokni, Vahab, Viswanath Nagarjan, Sviridenko, Maxim
Published in arXiv.org (02.02.2009)
Get full text
Published in arXiv.org (02.02.2009)
Paper