Inscrição na biblioteca: Guest
Journal of Automation and Information Sciences

Publicou 12 edições por ano

ISSN Imprimir: 1064-2315

ISSN On-line: 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

Volume 49, Edição 5, 2017, pp. 49-58
DOI: 10.1615/JAutomatInfScien.v49.i5.40
Get accessGet access

RESUMO

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 Digital Begell Biblioteca digital da Begell eBooks Diários Referências e Anais Coleções de pesquisa Políticas de preços e assinaturas Begell House Contato Language English 中文 Русский Português German French Spain