Heuristic search and pruning in polynomial constraints satisfaction

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.19, Iss.3-4, 1997-01, pp. : 319-334

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

Kernel Search: a new heuristic framework for portfolio selection

By Angelelli Enrico

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 345-361

Springer Publishing Company

Access to resources Recommend Favorite

Analysis of a Local Search Heuristic for Facility Location Problems

By Korupolu M.R. Plaxton C.G. Rajaraman R.

Journal of Algorithms, Vol. 37, Iss. 1, 2000-10 ,pp. : 146-188

Academic Press

Access to resources Recommend Favorite

Measuring the satisfaction of constraints in fuzzy linear programming

By Liu X.

Fuzzy Sets and Systems, Vol. 122, Iss. 2, 2001-09 ,pp. : 263-275

Elsevier

Access to resources Recommend Favorite

A Semidefinite Programming Heuristic for Quadratic Programming Problems with Complementarity Constraints

By Braun Stephen Mitchell John

Computational Optimization and Applications, Vol. 31, Iss. 1, 2005-05 ,pp. : 5-29

Springer Publishing Company

Access to resources Recommend Favorite

Non-local improvement method in polynomial optimal control problems with terminal constraints

By Trunin D. O. Buldaev A. S.

Optimization, Vol. 58, Iss. 7, 2009-10 ,pp. : 771-779

Taylor & Francis Ltd

Access to resources Recommend Favorite