Buscas alternativas:
fast algorithms » ant algorithms (Expandir a busca), based algorithms (Expandir a busca), exact algorithms (Expandir a busca)
cut algorithm » cut algorithms (Expandir a busca), bat algorithm (Expandir a busca), mppt algorithm (Expandir a busca)
branch » branco (Expandir a busca), branca (Expandir a busca)
fast algorithms » ant algorithms (Expandir a busca), based algorithms (Expandir a busca), exact algorithms (Expandir a busca)
cut algorithm » cut algorithms (Expandir a busca), bat algorithm (Expandir a busca), mppt algorithm (Expandir a busca)
branch » branco (Expandir a busca), branca (Expandir a busca)
1
Assuntos:
“...Branch and Cut...”
Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits
Tese
2
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for the clustered and generalized vehicle routing problems
Dissertação
3
Assuntos:
“...Algorithms...”
Algoritmos relax-and-cut para problemas de programação inteira 0-1
Tese
4
5
Assuntos:
“...[pt] BRANCH-AND-CUT...”
[en] A NEW BRANCH-AND-CUT ALGORITHM FOR THE GENERALIZED LEAST COST INFLUENCE PROBLEM IN NETWORKS
Tese
6
Assuntos:
“...Branch-and-cut algorithms...”
Estudo poliedral do problema do maximo subgrafo induzido comum
Dissertação
7
Assuntos:
“...Branch-and-cut algorithms...”
Métodos de resolução e modelagem para o problema de rotas de cobertura multiveículo
Tese
8
Assuntos:
“...Branch-cut-and-price...”
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Tese
9
Assuntos:
“...Branch and Cut algorithm...”
Estudo poliedral do problema do máximo subgrafo induzido comum
Dissertação
10
Assuntos:
“...Branch-and-prune algorithms...”
Geometria de distâncias e o problema do loop fechado
Tese
11
Assuntos:
“...Branch-and-Cut...”
Algoritmos exatos para o problema de edição de p-Clusters
Dissertação
12
Assuntos:
“...Branch- and-Cut...”
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
Tese
13
14
“... National Institute of Standards and Technology (NIST) launched a competition to select an LWC algorithm...”
Acceleration of AEAD algorithms for resource-constrained embedded devices
Dissertação
15
Assuntos:
“...Branch-Cut-And-Price...”
Branch-cut-and-price para o problema de roteamento de veículos generalizado
Dissertação
16
17
18
Assuntos:
“...Branch-and-prune algorithms...”
Álgebra geométrica conforme em geometria de distâncias com incertezas
Tese
19
20
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for two multi-depot vehicie routing problem variants
Dissertação