Persistency in 0-1 Polynomial Programming
From MaRDI portal
Publication:2757539
DOI10.1287/moor.23.2.359zbMath0977.90025MaRDI QIDQ2757539
Hanif D. Sherali, Warren P. Adams, Julie Bowers Lassiter
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.23.2.359
Related Items
A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, A network approach for specially structured linear programs arising in 0-1 quadratic optimization