A new formulation and a branch-and-cut algorithm for the set orienteering problem
Year of publication: |
2024
|
---|---|
Authors: | Archetti, Claudia ; Carrabs, Francesco ; Cerulli, Raffaele ; Laureana, Federica |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 314.2024, 2 (16.4.), p. 446-465
|
Subject: | Branch-and-cut | Integer linear programming | Orienteering problem | Routing | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
Description of contents: | Description [sciencedirect.com] |
-
A revisited branch-and-cut algorithm for large-scale orienteering problems
Kobeaga, Gorka, (2024)
-
Gouveia, Luis, (2017)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
- More ...
-
Archetti, Claudia, (2018)
-
Lower and upper bounds for the spanning tree with minimum branch vertices
Carrabs, Francesco, (2013)
-
The labeled maximum matching problem
Carrabs, Francesco, (2009)
- More ...