Persistency in 0-1 Polynomial Programming

DOI10.1287/moor.23.2.359zbMath0977.90025OpenAlexW2001036734MaRDI QIDQ2757539

Julie Bowers Lassiter, Warren P. Adams, Hanif D. Sherali

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

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Boolean programming (90C09)

Related Items

Distributionally robust mixed integer linear programs: persistency models with applications, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, A ``joint + marginal heuristic for 0/1 programs, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems