Поиск

Автор

Ключевое слово

Тип статьи

DOI

ORCID

Дополнительно:

Период публикации

Репозиторий

По вашему запросу найдено документов: 35143

Страница 1 из 3515

which are used in a branch-and-bound algorithm. Computational experiments show that an exact solution

of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method

of the equivalent convex programming problem we construct an algorithm using the idea of the branch and bound method

The traveling salesman problem: approximate algorithm by branch-and-bound method with guaranteed

, and, contrary to the binary language case, the computational power of Las-Vegas QFAs and bounded

principles of the branch and bound method. Its feature is the proposed algorithm for estimating the bounds

Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization

function value which are used in a branch-and-bound algorithm. Computational experiments show

bounds for models like automata, Ordered Binary Decision Diagrams and streaming algorithms. At the same

Two schemes of the branch-and-bound method for a flow shop total weighted tardiness minimization

Страница 1 из 3515