1
“..., 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
2
“... a técnica de relax-and-cut dinamicamente à relaxação contínua do problema, utilizando algumas classes...”
[en] ALGORITHM RELAX-AND-CUT FOR THE 0-1 QUADRATIC KNAPSACK PROBLEM
Tese
3
“..., visiting each city once, and returning to the city of origin with minimum total cost. The simple enunciate...”
Relax and cut: limitantes duais para o problema do caixeiro viajante
Dissertação
4
Assuntos:
“...Branch-and-Cut...”
The profitable single truck and trailer routing problem with time windows
Dissertação
5
Assuntos:
“...Branch-and-Cut...”
Algoritmos exatos para o problema de edição de p-Clusters
Dissertação
6
“... as Capacitated Vehicle Routing Problem, proposing some Column-andcut algorithms to its resolution faster and with...”
O problema do transporte escolar rural: uma abordagem Column-and-cut para o problema de roteamento de veículos capacitado
Dissertação
7
Assuntos:
“...Relax-and-Cut...”
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
Tese
8
“... here. To solve it, we developed a Non Delayed Relax-and-Cut algorithm, a Lagrangian analog to a cutting...”
Algoritmo relax-and-cut para o problema do conjunto independente máximo
Dissertação
9
Assuntos:
“...[pt] BRANCH-CUT-AND-PRICE...”
[pt] ALGORITMOS EXATOS PARA PROBLEMAS DE ROTEAMENTO EM ARCOS E EM VÉRTICES
Tese
10
“... bounds on the genus, number of boundary components and area of any compact two-sided capillary minimal...”
Systoles and minimal surfaces in 3-manifolds with boundary
Tese
11
12
Assuntos:
“...Algoritmos branch-and-cut...”
O problema do subgrafo biconexo mínimo generalizado: algoritmos e formulações
Dissertação
13
14
“... effects of the non-zero space curvature in terms of LSS formation for a cosmological model with a RCC and...”
Cosmological model with running vacuum energy and warm dark matter
Tese
15
“... of the form =f(x)+g(x)u with state and input constraints, and subjected to model uncertainties. Classical...”
Intelligent controllers for dynamic systems with state and input constraints and subjected to model uncertainties.
Tese
16
17
18
“... of the subgradient method with exogenous step-size and Polyak’s step size are stablished, completing and...”
Optimization methods on Riemannian manifolds with lower bound curvature: gradient for scalar and multi-objective functions and subgradient for scalar functions
Tese
19
“... on Banach spaces, with bounds in terms of the dimension of the symbol space and a Kolmogorov entropy number...”
Finite-dimensionality of attractors for dynamical systems with applications: deterministic and random settings
Tese