Suscripción a Biblioteca: Guest
Journal of Automation and Information Sciences

Publicado 12 números por año

ISSN Imprimir: 1064-2315

ISSN En Línea: 2163-9337

SJR: 0.173 SNIP: 0.588 CiteScore™:: 2

Indexed in

Branch-and-Bound Method for Problems of the Euclidian Combinatorial Optimization on Combinations

Volumen 49, Edición 5, 2017, pp. 49-58
DOI: 10.1615/JAutomatInfScien.v49.i5.40
Get accessGet access

SINOPSIS

Consideration is given to the branch-and-bound method for problems of the Euclidian combinatorial optimization with general combinations, where multiplicity of potential recurrence of each element is individually specified. The rules of branching, estimation and nodes detachment in the branch and bound method are presented.

Portal Digitalde Biblioteca Digital eLibros Revistas Referencias y Libros de Ponencias Colecciones Precios y Políticas de Suscripcione Begell House Contáctenos Language English 中文 Русский Português German French Spain