A Branch‐and‐Bound Approach for Tautomer Enumeration

E-ISSN： 1868-1751|34|5|263-275

ISSN： 1868-1743

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

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

Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound Approaches

By Bomze Immanuel M. Locatelli Marco

Computational Optimization and Applications, Vol. 28, Iss. 2, 2004-07 ,pp. : 227-245

Springer Publishing Company

Access to resources Recommend Favorite

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

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

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Finiteness Result for the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

By Locatelli M. Raber U.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 1, 2000-10 ,pp. : 81-88

Springer Publishing Company

Access to resources Recommend Favorite

On Convergence of the Simplicial Branch-and-Bound Algorithm Based on ω-Subdivisions

By Locatelli M. Raber U.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 1, 2000-10 ,pp. : 69-79

Springer Publishing Company

Access to resources Recommend Favorite

Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs

By Benson H.

Journal of Optimization Theory and Applications, Vol. 146, Iss. 1, 2010-07 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite