A Branch-and-Bound Based Method for Solving Monotone Optimization Problems

ISSN： 0925-5001

Source： Journal of Global Optimization, Vol.35, Iss.2, 2006-06, pp. : 367-385

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

Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems

By Popov L.

Automation and Remote Control, Vol. 68, Iss. 5, 2007-05 ,pp. : 901-911

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Branch-and-Bound Algorithm for Concave Network Flow Problems

By Fontes Dalila Hadjiconstantinou Eleni Christofides Nicos

Journal of Global Optimization, Vol. 34, Iss. 1, 2006-01 ,pp. : 127-155

Springer Publishing Company

Access to resources Recommend Favorite

On a lower bound on the computational complexity of a parallel implementation of the branch-and-bound method

By Kolpakov R. Posypkin M. Sigal I.

Automation and Remote Control, Vol. 71, Iss. 10, 2010-10 ,pp. : 2152-2161

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Optimal Multisections in Interval Branch-and-Bound Methods of Global Optimization

By Lagouanelle Jean-Louis Soubry Gérard

Journal of Global Optimization, Vol. 30, Iss. 1, 2004-09 ,pp. : 23-38

Springer Publishing Company

Access to resources Recommend Favorite

A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems

By Kuno Takahito

Journal of Global Optimization, Vol. 33, Iss. 2, 2005-10 ,pp. : 215-234

Springer Publishing Company

Access to resources Recommend Favorite