Robust team orienteering problem with decreasing profits
Year of publication: |
2022
|
---|---|
Authors: | Yu, Qinxiao ; Cheng, Chun ; Zhu, Ning |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 6, p. 3215-3233
|
Subject: | robust optimization | branch-and-price | tabu search | team orienteering | uncertain service time | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Arbeitsgruppe | Team | Heuristik | Heuristics | Rundreiseproblem | Travelling salesman problem | Robustes Verfahren | Robust statistics |
-
Robust optimization for the vehicle routing problem with multiple deliverymen
Vega, Jonathan de la, (2019)
-
A branch-and-price algorithm for a team orienteering problem with fixed-wing drones
Sundar, Kaarthik, (2022)
-
Robust quadratic assignment problem with budgeted uncertain flows
Feizollahi, Mohammad Javad, (2015)
- More ...
-
Distributionally robust facility location with uncertain facility capacity and customer demand
Cheng, Chun, (2024)
-
A matheuristic approach to the orienteering problem with service time dependent profits
Yu, Qinxiao, (2019)
-
Team orienteering with time-varying profit
Yu, Qinxiao, (2022)
- More ...