Buscas alternativas:
algorithm and » algorithms and (Expandir a busca), algorithm based (Expandir a busca), algorithm _ (Expandir a busca)
and problems » of problems (Expandir a busca), _ problems (Expandir a busca)
algorithm and » algorithms and (Expandir a busca), algorithm based (Expandir a busca), algorithm _ (Expandir a busca)
and problems » of problems (Expandir a busca), _ problems (Expandir a busca)
1
Assuntos:
“...Iterated greedy algorithm...”
Automatic algorithm configuration for flow shop scheduling problems
Tese
3
Assuntos:
“...Shooting algorithm...”
On the shooting algorithm for partially affine control problems
Dissertação
4
5
Assuntos:
“...Routing problems...”
A variable neighborhood search algorithm for a class of electric vehicle routing problems.
Tese
6
Assuntos:
“...Extragradient algorithm...”
Generalized vector equilibrium problems and algorithms for variational inequality in hadamard manifolds
Tese
7
Assuntos:
“...Automatic algorithm configuration....”
Automatic algorithm configuration : methods and applications
Tese
9
“...Two robust optimization NP-Hard problems are studied in this thesis: the min-max regret WSCP and...”
Robust covering problems: formulations, algorithms and application
Tese
10
Assuntos:
“...[en] DESIGN PROBLEMS...”
[en] IDENTIFICATION AND REFACTORING OF DESIGN PROBLEMS IN SOFTWARE SYSTEMS
Tese
11
Assuntos:
“...Genetic algorithm...”
A stochastic multi-state cellular automata model and its application in scheduling and density classification problems
Tese
12
“...Ant algorithm to track the optimal Dynamic Routing Networks and Dynamic Multidimensional Knapsack problems...”
A proposal for an improved version of EigenAnt algorithm with performance evaluation on combinatorial optimization problems
Tese
13
Assuntos:
“...Multiple-depot vehicle and crew scheduling...”
A matheuristic algorithm for the multiple-depot vehicle and crew scheduling problem
Tese
14
“... 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
15
Assuntos:
“...[pt] BRANCH AND PRICE...”
[en] A BRANCH AND PRICE ALGORITHM FOR A STATIC AMBULANCE ROUTING PROBLEM
Tese
16
Assuntos:
“...Local and global convergence...”
Inexact methods for constrained optimization problems and for constrained monotone nonlinear equations
Tese
17
“...-equivalence modulo A, C and AC are specified in Coq and proved sound. An algorithm implemented in OCaml...”
Nominal Equational Problems Modulo Associativity, Commutativity and Associativity-Commutativity
Tese
18
“... interfaces in the problems of electrical impedance tomography (EIT) and geophysical exploration by full...”
Shape optimization and level set method applied to inversion problems
Tese
19
20
“... inteira neste contexto é tratada em seguida, com a descrição do algoritmo branch-and-bound e das variações...”
[en] INTEGER PROGRAMMING TECHNIQUES AND APPLICATIONS TO VEHICLE ROUTING PROBLEMS
Tese