Buscas alternativas:
fast algorithms » based algorithms (Expandir a busca), exact algorithms (Expandir a busca), and algorithms (Expandir a busca)
cut algorithms » cut algorithm (Expandir a busca), and algorithms (Expandir a busca), of algorithms (Expandir a busca)
ant algorithms » and algorithms (Expandir a busca), exact algorithms (Expandir a busca), of algorithms (Expandir a busca)
dht algorithms » and algorithms (Expandir a busca), of algorithms (Expandir a busca), cut algorithm (Expandir a busca)
branch » branco (Expandir a busca), branca (Expandir a busca)
fast algorithms » based algorithms (Expandir a busca), exact algorithms (Expandir a busca), and algorithms (Expandir a busca)
cut algorithms » cut algorithm (Expandir a busca), and algorithms (Expandir a busca), of algorithms (Expandir a busca)
ant algorithms » and algorithms (Expandir a busca), exact algorithms (Expandir a busca), of algorithms (Expandir a busca)
dht algorithms » and algorithms (Expandir a busca), of algorithms (Expandir a busca), cut algorithm (Expandir a busca)
branch » branco (Expandir a busca), branca (Expandir a busca)
1
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for the clustered and generalized vehicle routing problems
Dissertação
2
Assuntos:
“...Branch-and-cut algorithms...”
Métodos de resolução e modelagem para o problema de rotas de cobertura multiveículo
Tese
3
Assuntos:
“...Branch and Cut...”
Algorithms to improve area density utilization, routability and timing during detailed placement and legalization of VLSI circuits
Tese
4
5
Assuntos:
“...Branch-cut-and-price...”
Branch-cut-and-price algorithms for two multi-depot vehicie routing problem variants
Dissertação
6
Assuntos:
“...Branch-and-cut algorithms...”
Algoritmos para resolução do problema de empacotamento de conjuntos utilizando poliedros quase inteiros
Dissertação
7
Assuntos:
“...Branch-and-cut algorithms...”
Estudo poliedral do problema do maximo subgrafo induzido comum
Dissertação
8
Assuntos:
“...Algorithms...”
Algoritmos relax-and-cut para problemas de programação inteira 0-1
Tese
9
Assuntos:
“...Branch-and-Cut...”
Algoritmos exatos para o problema de edição de p-Clusters
Dissertação
10
Assuntos:
“...[pt] BRANCH-AND-CUT...”
[en] A NEW BRANCH-AND-CUT ALGORITHM FOR THE GENERALIZED LEAST COST INFLUENCE PROBLEM IN NETWORKS
Tese
11
Assuntos:
“...Algoritmo Branch and Cut...”
Estudo poliedral do problema do máximo subgrafo induzido comum
Dissertação
12
13
14
15
16
Assuntos:
“...Branch- and-Cut...”
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
Tese
17
Assuntos:
“...[pt] BRANCH-CUT-AND-PRICE...”
[pt] ALGORITMOS EXATOS PARA PROBLEMAS DE ROTEAMENTO EM ARCOS E EM VÉRTICES
Tese
18
Assuntos:
“...Branch-and-cut...”
Optimization models and solution methods for inventory routing problems
Tese