Constraint qualification in a general class of Lipschitzian mathematical programming problems

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.38, Iss.4, 2007-08, pp. : 625-635

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

Solving subgraph isomorphism problems with constraint programming

By Zampelli Stéphane

Constraints, Vol. 15, Iss. 3, 2010-07 ,pp. : 327-353

Springer Publishing Company

Access to resources Recommend Favorite

Methods of embedding-cutting off in problems of mathematical programming

By Bulatov Valerian

Journal of Global Optimization, Vol. 48, Iss. 1, 2010-09 ,pp. : 3-15

Springer Publishing Company

Access to resources Recommend Favorite

A Unified Class of Directly Solvable Semidefinite Programming Problems

By Muramatsu Masakazu

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

Springer Publishing Company

Access to resources Recommend Favorite

Convexification and Concavification for a General Class of Global Optimization Problems

By Wu Z. Bai F. Zhang L.

Journal of Global Optimization, Vol. 31, Iss. 1, 2005-01 ,pp. : 45-60

Springer Publishing Company

Access to resources Recommend Favorite

An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

By Dovier Agostino

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 21, Iss. 2, 2009-06 ,pp. : 79-121

Taylor & Francis Ltd

Access to resources Recommend Favorite