A revisited branch-and-cut algorithm for large-scale orienteering problems
Year of publication: |
2024
|
---|---|
Authors: | Kobeaga, Gorka ; Rojas-Delgado, Jairo ; Merino, María ; Lozano, Jose A. |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 313.2024, 1 (16.2.), p. 44-68
|
Subject: | Branch-and-cut | Large problems | Orienteering problem | Routing | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A new formulation and a branch-and-cut algorithm for the set orienteering problem
Archetti, Claudia, (2024)
-
The clustered orienteering problem
Angelelli, E., (2014)
-
A matheuristic approach to the orienteering problem with service time dependent profits
Yu, Qinxiao, (2019)
- More ...
-
An efficient evolutionary algorithm for the orienteering problem
Kobeaga, Gorka, (2018)
-
Santana, Roberto, (2010)
-
The linear ordering problem revisited
Ceberio, Josu, (2015)
- More ...