Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs

Author： Sherali Hanif  

Publisher： Springer Publishing Company

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.51, Iss.3, 2011-11, pp. : 377-393

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

A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints

By Shim Yohan   Fodstad Marte   Gabriel Steven   Tomasgard Asgeir  

Annals of Operations Research, Vol. 210, Iss. 1, 2013-11 ,pp. : 5-31

Springer Publishing Company

Access to resources Recommend Favorite

Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering

By Aloise Daniel   Hansen Pierre  

Journal of Global Optimization, Vol. 49, Iss. 3, 2011-03 ,pp. : 449-465

Springer Publishing Company

Access to resources Recommend Favorite

Solving polynomial least squares problems via semidefinite programming relaxations

By Kim Sunyoung   Kojima Masakazu  

Journal of Global Optimization, Vol. 46, Iss. 1, 2010-01 ,pp. : 1-23

Springer Publishing Company

Access to resources Recommend Favorite

Enhancing GridFTP performance using intelligent gateways

By Demir Onur   Head Michael R.   Ghose Kanad   Govindaraju Madhusudhan  

International Journal of High Performance Computing and Networking, Vol. 5, Iss. 3, 2008-10 ,pp. : 135-143

Inderscience Publishers

Access to resources Recommend Favorite

A Modified Relaxation Scheme for Mathematical Programs with Complementarity Constraints

By Lin Gui-Hua  

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 63-84

Springer Publishing Company

Access to resources Recommend Favorite