Buscas alternativas:
exact algorithms » search algorithms (Expandir a busca), and algorithms (Expandir a busca)
ant algorithms » and algorithms (Expandir a busca), of algorithms (Expandir a busca), quantum algorithms (Expandir a busca)
dht algorithms » cut algorithms (Expandir a busca), fast algorithms (Expandir a busca), and 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)
exact algorithms » search algorithms (Expandir a busca), and algorithms (Expandir a busca)
ant algorithms » and algorithms (Expandir a busca), of algorithms (Expandir a busca), quantum algorithms (Expandir a busca)
dht algorithms » cut algorithms (Expandir a busca), fast algorithms (Expandir a busca), and 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
2
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for the clustered and generalized vehicle routing problems
Dissertação
3
4
Assuntos:
“...[pt] BRANCH-AND-CUT...”
[en] A NEW BRANCH-AND-CUT ALGORITHM FOR THE GENERALIZED LEAST COST INFLUENCE PROBLEM IN NETWORKS
Tese
5
6
Assuntos:
“...Branch-cut-and-price...”
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Tese
7
Assuntos:
“...Exact algorithms...”
Branch & price for the virtual network embedding problem
Dissertação
8
Assuntos:
“...Branch-Cut-And-Price...”
Branch-cut-and-price para o problema de roteamento de veículos generalizado
Dissertação
9
Assuntos:
“...Branch and Cut algorithm...”
Estudo poliedral do problema do máximo subgrafo induzido comum
Dissertação
10
Assuntos:
“...Branch-and-cut algorithms...”
Estudo poliedral do problema do maximo subgrafo induzido comum
Dissertação
11
“... dos grafos (clique máximo). Propomos um algoritmo de Branch-and-Bound para resolver exatamente QKP, baseado...”
[en] ALGORITHM RELAX-AND-CUT FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM
Tese
12
Assuntos:
“...Algorithms...”
Algoritmos relax-and-cut para problemas de programação inteira 0-1
Tese
13
Assuntos:
“...Branch- and-Cut...”
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
Tese
14
Assuntos:
“...Branch-and-Cut...”
Algoritmos exatos para o problema de edição de p-Clusters
Dissertação
15
Assuntos:
“...Branch-and-cut-and-price...”
Algoritmos branch-and-cut-and-price para o problema da árvore geradora de custo mínimo com restrição de grau
Dissertação
16
Assuntos:
“...Branch-and- Bound...”
Exact and heuristic methods for heterogeneous assembly line balancing problems of type 2.
Tese
17
Assuntos:
“...Branch and Cut...”
Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits
Tese
18
19
Assuntos:
“...Branch-and-cut....”
Localização de sensores de tráfego com limitações quanto ao número de equipamentos e de faixas observadas : técnicas heurísticas e um branch-and-cut
Dissertação