Cutting Planes Methods
Mostrando 1-2 de 2 artigos, teses e dissertações.
-
1. Algoritmos rápidos de detecção de colisão : broad phase utilizando KD-trees / Algoritmos Rápidos de Detecção de Colisão Broad Phase utilizando KD-Trees.
In this work, three novel and fast broad phase collision detection algorithms, which utilize the spatial partitioning structure known as KD-Tree, were proposed and implemented: KDTreeSpace, DynamicKDTreeSpace and StatelessKDTreeSpace. These algorithms were integrated to the Open Dynamics Engine (ODE) library, which is in charge of calculating the motion of t
Publicado em: 2010
-
2. AN ALGORITHM WITH COLUMN AND CUT GENERATION FOR THE CAPACITATED VEHICLE ROUTING PROBLEM / UM ALGORITMO DE GERAÇÃO DE COLUNAS E CORTES PARA O PROBLEMA DE ROTEAMENTO DE VEÍCULOS
The Capacitated Vehicle Routing problem (CVRP) has been one of the most studied problems in the field of Combinatorial Optimization. A straight forward generalization of the popular Travelling Salesperson problem, the CVRP has drawn attention of the most prominent researchers since the early 60`s. One of the most important algorithms appeared in the early 80
Publicado em: 2004