Intractability of approximate multi-dimensional nonlinear optimization on independence systems

DOI10.1016/j.disc.2011.01.029zbMath1218.90185arXiv1001.5056OpenAlexW1968366778MaRDI QIDQ533792

Jon Lee, Shmuel Onn, Robert Weismantel

Publication date: 6 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.5056

zbMATH Keywords

inapproximabilityErdős-Ko-Radononlinear discrete optimization

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Cites Work

• Nonlinear discrete optimization. An algorithmic theory
• An Erdös-Ko-Rado theorem for direct products
• Parametric nonlinear discrete optimization over well-described sets and matroid intersections
• Approximate Nonlinear Optimization over Weighted Independence Systems
• Nonlinear Matroid Optimization and Experimental Design
• The complexity of restricted spanning tree problems