An Exact Algorithm for the Hazardous Orienteering Problem

ABSTRACT The hazardous orienteering problem is the topic of this study. It is a variant of the well‐studied orienteering problem, where a vehicle, given a maximum mission time, has to select and visit customers out of a set of requests, aiming at maximizing the total profit associated with the custo...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Networks Ročník 86; číslo 2; s. 105 - 111
Hlavní autori:	Montemanni, Roberto, Smith, Derek H.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken, USA John Wiley & Sons, Inc 01.09.2025 Wiley Subscription Services, Inc
Predmet:	Catastrophic events Customers hazardous applications Integer programming Linear programming Mixed integer mixed integer linear programming model‐based algorithms Orienteering orienteering problems
ISSN:	0028-3045, 1097-0037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!