The clustered orienteering problem
Year of publication: |
2014
|
---|---|
Authors: | Angelelli, E. ; Archetti, C. ; Vindigni, M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 238.2014, 2 (16.10.), p. 404-414
|
Subject: | Orienteering Problem | Branch-and-cut | Tabu search | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Tourenplanung | Vehicle routing problem |
-
Gotta (efficiently) catch them all : Pokémon GO meets orienteering problems
Álvarez-Miranda, Eduardo, (2018)
-
A revisited branch-and-cut algorithm for large-scale orienteering problems
Kobeaga, Gorka, (2024)
-
A new formulation and a branch-and-cut algorithm for the set orienteering problem
Archetti, Claudia, (2024)
- More ...
-
The Clustered Orienteering Problem
Angelelli, E., (2014)
-
Exploring greedy criteria for the dynamic traveling purchaser problem
Angelelli, E., (2009)
-
Exploring greedy criteria for the dynamic traveling purchaser problem
Angelelli, E., (2009)
- More ...