A branch-and-cut algorithm for the target visitation problem
In this paper, we consider the target visitation problem (TVP) which arises in the context of disaster treatment. Mathematically speaking, the problem is concerned with finding a route to visit a set of targets starting from and returning to some base. In addition to the distance travelled, a tour i...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2019
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/d867aa1b8ab94a7eb76553ca4d9915f5 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|