Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

Author： Billionnet Alain   Elloumi Sourour   Plateau Marie-Christine  

Publisher： Edp Sciences

E-ISSN： 1290-3868|42|2|103-121

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.42, Iss.2, 2008-05, pp. : 103-121

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

An interior point algorithm for convex quadratic programming withstrict equilibrium constraints

By Benouahboun Rachid   Mansouri Abdelatif  

RAIRO - Operations Research, Vol. 39, Iss. 1, 2010-03 ,pp. : 13-33

Edp Sciences

Access to resources Recommend Favorite

Linear and quadratic models of the southern Murray-Darling basin

By Hall  

Environment International, Vol. 27, Iss. 2, 2001-09 ,pp. : 219-223

Elsevier

Access to resources Recommend Favorite

Optimal Rendezvous Guidance Using Linear Quadratic Control

By Moon Gun-Hee  

MATEC Web of conference, Vol. 54, Iss. issue, 2016-04 ,pp. : 09002-09002

Edp Sciences

Access to resources Recommend Favorite

A Polynomial-time Interior-point Algorithm for Convex QuadraticSemidefinite Optimization

By Bai Y. Q.   Wang F. Y.   Luo X. W.  

RAIRO - Operations Research, Vol. 44, Iss. 3, 2010-10 ,pp. : 251-265

Edp Sciences

Access to resources Recommend Favorite

Interval stochastic quadratic programming approach for municipal solid waste management

By Huang G.H.   Li Y.P.   Guo P.  

Journal of Environmental Engineering and Science, Vol. 7, Iss. 6, 2008-11 ,pp. : 569-579

NRC Research Press

Access to resources Recommend Favorite