Buscas alternativas:
cut algorithms » cut algorithm (Expandir a busca), ant algorithms (Expandir a busca), dht algorithms (Expandir a busca)
mppt algorithm » bat algorithm (Expandir a busca)
an algorithm » bat algorithm (Expandir a busca)
branch » branco (Expandir a busca), branca (Expandir a busca)
cut algorithms » cut algorithm (Expandir a busca), ant algorithms (Expandir a busca), dht algorithms (Expandir a busca)
mppt algorithm » bat algorithm (Expandir a busca)
an algorithm » bat algorithm (Expandir a busca)
branch » branco (Expandir a busca), branca (Expandir a busca)
1
Assuntos:
“...[pt] BRANCH-AND-CUT...”
[en] A NEW BRANCH-AND-CUT ALGORITHM FOR THE GENERALIZED LEAST COST INFLUENCE PROBLEM IN NETWORKS
Tese
2
Assuntos:
“...[pt] BRANCH AND PRICE...”
[en] A BRANCH AND PRICE ALGORITHM FOR A STATIC AMBULANCE ROUTING PROBLEM
Tese
3
“..., que pode ser rotulado como de branch-and-cut-and-price, trabalha com um número exponencial de variáveis...”
[en] AN ALGORITHM WITH COLUMN AND CUT GENERATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM
Tese
4
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for the clustered and generalized vehicle routing problems
Dissertação
5
Assuntos:
“...Branch and Cut...”
Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits
Tese
6
Assuntos:
“...Branch-and-cut algorithms...”
Métodos de resolução e modelagem para o problema de rotas de cobertura multiveículo
Tese
7
Assuntos:
“...Branch and Cut algorithm...”
Estudo poliedral do problema do máximo subgrafo induzido comum
Dissertação
8
9
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for two multi-depot vehicie routing problem variants
Dissertação
10
Assuntos:
“...Branch-cut-and-price...”
A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Tese
11
“... multi-tenant resource manager model is defined. We solve the resulting ILP problem using both branch and...”
An adaptable storage slicing algorithm for content delivery networks
Tese
12
13
Assuntos:
“...Branch-and-cut algorithms...”
Algoritmos para resolução do problema de empacotamento de conjuntos utilizando poliedros quase inteiros
Dissertação
14
Assuntos:
“...Branch-and-cut algorithms...”
Estudo poliedral do problema do maximo subgrafo induzido comum
Dissertação
15
Assuntos:
“...Multiple-depot vehicle and crew scheduling...”
A matheuristic algorithm for the multiple-depot vehicle and crew scheduling problem
Tese
16
“... 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
17
Assuntos:
“...Algorithms...”
Algoritmos relax-and-cut para problemas de programação inteira 0-1
Tese
18
Assuntos:
“...Branch- and-Cut...”
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
Tese
19
Assuntos:
“...Branch-and-Cut...”
Algoritmos exatos para o problema de edição de p-Clusters
Dissertação