Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits
Year of publication: |
2024
|
---|---|
Authors: | Liu, Jiaojiao ; Zhu, Jianghan ; Peng, Guansheng ; Wang, Jianjiang ; Zhen, Lu ; Demeulemeester, Erik |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 319.2024, 3 (16.12.), p. 793-807
|
Subject: | Branch-Price-and-Cut | Dantzig-Wolfe decomposition | Interval-varying profits | Mixed-integer linear programming | Team orienteering problem | Mathematische Optimierung | Mathematical programming | Arbeitsgruppe | Team | Theorie | Theory | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm | Rundreiseproblem | Travelling salesman problem | Dekompositionsverfahren | Decomposition method |
-
Yahiaoui, Ala-Eddine, (2023)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
A decomposition algorithm for the consistent traveling salesman problem with vehicle idling
Subramanyam, Anirudh, (2018)
- More ...
-
Wang, Jianjiang, (2014)
-
Wang, Jianjiang, (2014)
-
Wang, Jianjiang, (2016)
- More ...