Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Adams, W., Gupte, A., Xu, Y.: Error bounds for monomial convexification in polynomial optimization. Math. Program. Ser. A (2018).
https://doi.org/10.1007/s10107-018-1246-8
2. Adams, W., Sherali, H.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32(10), 1274–1290 (1986)
3. Adams, W., Sherali, H.: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems. Ann. Oper. Res. 140(1), 21–47 (2005)
4. Crama, Y.: Concave extensions for nonlinear 0–1 maximization problems. Math. Program. 61(1), 53–60 (1993)
5. Fortet, R.: L’algèbre de boole et ses applications en recherche opérationelle. Cahiers du Centre d’Études de Recherche Opérationelle 1(4), 5–36 (1959)