Tight Relaxation of Quadratic Matching

E-ISSN： 1467-8659|34|5|115-128

ISSN： 0167-7055

Source： COMPUTER GRAPHICS FORUM (ELECTRONIC), Vol.34, Iss.5, 2015-08, pp. : 115-128

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

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

Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds

By Kimms A.

Annals of Operations Research, Vol. 102, Iss. 1-4, 2001-02 ,pp. : 221-236

Springer Publishing Company

Access to resources Recommend Favorite

An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs

By Pham Dinh Tao Nguyen Canh Nam Le Thi Hoai

Journal of Global Optimization, Vol. 48, Iss. 4, 2010-12 ,pp. : 595-632

Springer Publishing Company

Access to resources Recommend Favorite

A robust algorithm for quadratic optimization under quadratic constraints

By Tuy Hoang Hoai-Phuong N.

Journal of Global Optimization, Vol. 37, Iss. 4, 2007-04 ,pp. : 557-569

Springer Publishing Company

Access to resources Recommend Favorite

Constraint propagation on quadratic constraints

By Domes Ferenc

Constraints, Vol. 15, Iss. 3, 2010-07 ,pp. : 404-429

Springer Publishing Company

Access to resources Recommend Favorite