Wird geladen...
Algoritmos non delayed relax-and-cut para o problema do caixeiro viajante assimétrico
The Traveling Salesman Problem (PCV) is one of the most studied problems in the literature, having applications in different areas such as logistics, robotics and transportation of materials and people. In this Work, we propose a Non Delayed-Relax-and-Cut (NDRC) algorithm for the Asymmetric Travelin...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Dissertação |
| Sprache: | Português |
| Veröffentlicht: |
Universidade Federal do Rio de Janeiro
2019-09
|
| Schlagworte: | |
| Online Zugang: | http://hdl.handle.net/11422/14058 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|