Branch-and-Bound interval global optimization on shared memory multiprocessors

Author： Casado L. G.   Martinez J. A.   Garcia I.   Hendrix E. M. T.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.23, Iss.5, 2008-10, pp. : 689-701

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

Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods

By Fernández José   Tóth Boglárka  

Computational Optimization and Applications, Vol. 42, Iss. 3, 2009-04 ,pp. : 393-419

Springer Publishing Company

Access to resources Recommend Favorite

ICOS: a branch and bound based solver for rigorous global optimization

By Lebbah Y.  

Optimization Methods and Software, Vol. 24, Iss. 4-5, 2009-08 ,pp. : 709-726

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel branch and bound for global optimization with combination of Lipschitz bounds

By Paulavičius Remigijus   Žilinskas Julius   Grothey Andreas  

Optimization Methods and Software, Vol. 26, Iss. 3, 2011-06 ,pp. : 487-498

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Branch‐and‐Bound Approach for Tautomer Enumeration

By  

MOLECULAR INFORMATICS, Vol. 34, Iss. 5, 2015-05 ,pp. : 263-275

John Wiley & Sons Inc

Access to resources Recommend Favorite

Heuristic Rejection in Interval Global Optimization

By Casado L.G.   García I.   Csendes T.   Ruíz V.G.  

Journal of Optimization Theory and Applications, Vol. 118, Iss. 1, 2003-07 ,pp. : 27-43

Springer Publishing Company

Access to resources Recommend Favorite