Compact linearization for binary quadratic problems

ISSN： 1619-4500

Source： 4OR: Quarterly journal of the Belgian, French and Italian operations research societies, Vol.5, Iss.3, 2007-09, pp. : 231-245

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Decomposition and Linearization for 0-1 Quadratic Programming

By Elloumi S.

Annals of Operations Research, Vol. 99, Iss. 1-4, 2000-12 ,pp. : 79-93

Springer Publishing Company

Access to resources Recommend Favorite

Compact searchable static binary trees

By Durgan B.K.

Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. : 49-52

Elsevier

Access to resources Recommend Favorite

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints

By Zhang Xinzhen Ling Chen Qi Liqun

Journal of Global Optimization, Vol. 49, Iss. 2, 2011-02 ,pp. : 293-311

Springer Publishing Company

Access to resources Recommend Favorite

Global optimality conditions for quadratic 0-1 optimization problems

By Chen Wei Zhang Liansheng

Journal of Global Optimization, Vol. 46, Iss. 2, 2010-02 ,pp. : 191-206

Springer Publishing Company

Access to resources Recommend Favorite

Ellipsoidal Approach to Box-Constrained Quadratic Problems

By de Angelis Pasquale L. Bomze Immanuel M. Toraldo Gerardo

Journal of Global Optimization, Vol. 28, Iss. 1, 2004-01 ,pp. : 1-15

Springer Publishing Company

Access to resources Recommend Favorite