The multi-visit team orienteering problem with precedence constraints
Year of publication: |
2020
|
---|---|
Authors: | Hanafi, Saïd ; Mansini, Renata ; Zanotti, Roberto |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 282.2020, 2 (16.4.), p. 515-529
|
Subject: | Branch-and-cut | Kernel search | Precedence constraints | Routing | Team orienteering problem | Tourenplanung | Vehicle routing problem | Arbeitsgruppe | Team | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
-
Amarouche, Youcef, (2020)
-
Pareto mimic algorithm : an approach to the team orienteering problem
Ke, Liangjun, (2016)
-
Yahiaoui, Ala-Eddine, (2023)
- More ...
-
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
Lamanna, Leonardo, (2022)
-
Optimizing the physician scheduling problem in a large hospital ward
Mansini, Renata, (2020)
-
A core-based exact algorithm for the multidimensional multiple choice knapsack problem
Mansini, Renata, (2020)
- More ...