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...

Full description

Saved in:

Bibliographic Details
Published in:	Networks Vol. 86; no. 2; pp. 105 - 111
Main Authors:	Montemanni, Roberto, Smith, Derek H.
Format:	Journal Article
Language:	English
Published:	Hoboken, USA John Wiley & Sons, Inc 01.09.2025 Wiley Subscription Services, Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	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 customers selected. In the hazardous version of the problem we consider, the customers are associated with parcels that have to be collected, and some of them might explode during the transportation, after having been picked up. The probability of explosion depends on the characteristics of the parcel and on the time spent by the dangerous parcel itself on the vehicle. If an explosion happens, the collected profit is totally lost. The target becomes then to select the tour that maximizes the expected profit, taking into account the probability of catastrophic events happening. In this article, we propose an exact solving approach based on a mixed integer linear programming model which is dynamically modified by adding new constraints. The computational results substantially improve the state‐of‐the‐art for the problem.
AbstractList	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 customers selected. In the hazardous version of the problem we consider, the customers are associated with parcels that have to be collected, and some of them might explode during the transportation, after having been picked up. The probability of explosion depends on the characteristics of the parcel and on the time spent by the dangerous parcel itself on the vehicle. If an explosion happens, the collected profit is totally lost. The target becomes then to select the tour that maximizes the expected profit, taking into account the probability of catastrophic events happening. In this article, we propose an exact solving approach based on a mixed integer linear programming model which is dynamically modified by adding new constraints. The computational results substantially improve the state‐of‐the‐art for the 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 customers selected. In the hazardous version of the problem we consider, the customers are associated with parcels that have to be collected, and some of them might explode during the transportation, after having been picked up. The probability of explosion depends on the characteristics of the parcel and on the time spent by the dangerous parcel itself on the vehicle. If an explosion happens, the collected profit is totally lost. The target becomes then to select the tour that maximizes the expected profit, taking into account the probability of catastrophic events happening. In this article, we propose an exact solving approach based on a mixed integer linear programming model which is dynamically modified by adding new constraints. The computational results substantially improve the state‐of‐the‐art for the problem.
Author	Smith, Derek H. Montemanni, Roberto
Author_xml	– sequence: 1 givenname: Roberto orcidid: 0000-0002-0229-0465 surname: Montemanni fullname: Montemanni, Roberto email: roberto.montemanni@unimore.it organization: University of Modena and Reggio Emilia – sequence: 2 givenname: Derek H. surname: Smith fullname: Smith, Derek H. organization: University of South Wales
BookMark	eNp1kM9PwjAYhhuDiYAe_A-aePIw6I-1246EIJgQ8YDnpmu_wchosR1R_Oudzqun7_A-7_slzwgNnHeA0D0lE0oImzpoJ4yxrLhCQ0qKLCGEZwM07LI84SQVN2gU44EQSgXNh6iYObz41KbFs2bnQ93uj7jyAbd7wCv9pYP154g3oQbXAoTa7fBr8GUDx1t0Xekmwt3fHaO3p8V2vkrWm-XzfLZODCvSImEyy4BxXmid2coaWUrQ0pqy1MLatCJWalkZsJakJKdCC5Fro2XKcyolFHyMHvrdU_DvZ4itOvhzcN1LxRkXnOYylR312FMm-BgDVOoU6qMOF0WJ-jGjOjPq10zHTnv2o27g8j-oXhbbvvENzQ9mWQ
Cites_doi	10.1002/net.22129 10.1057/jors.1984.162 10.1016/j.cor.2025.107010 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D 10.1016/j.cor.2020.105107 10.1080/01605682.2020.1866443 10.1016/j.ejor.2010.03.045 10.1016/j.ejor.2007.06.031 10.1002/net.21993 10.1080/07408170701592481 10.1016/j.ejor.2016.04.059 10.1287/trsc.31.3.237 10.1137/130915315 10.1007/0-306-48213-4_13 10.1287/trsc.2019.0923 10.1016/j.ejor.2015.01.040 10.1016/j.cor.2016.12.025 10.1137/1.9781611973594.ch10 10.1016/j.psep.2011.06.022 10.1016/j.cor.2022.105848 10.1016/j.cor.2024.106947 10.1007/s10479-011-0895-2 10.12720/jtle.3.2.108-114
ContentType	Journal Article
Copyright	2025 The Author(s). published by Wiley Periodicals LLC. 2025. This work is published under Creative Commons Attribution License~https://creativecommons.org/licenses/by/3.0/ (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: 2025 The Author(s). published by Wiley Periodicals LLC. – notice: 2025. This work is published under Creative Commons Attribution License~https://creativecommons.org/licenses/by/3.0/ (the "License"). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	24P AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1002/net.22279
DatabaseName	Wiley Online Library Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts CrossRef
Database_xml	– sequence: 1 dbid: 24P name: Wiley Online Library Open Access url: https://authorservices.wiley.com/open-science/open-access/browse-journals.html sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1097-0037
EndPage	111
ExternalDocumentID	10_1002_net_22279 NET22279
Genre	researchArticle
GroupedDBID	-~X .3N .DC .GA .Y3 05W 0R~ 10A 123 1L6 1OB 1OC 1ZS 24P 31~ 33P 3SF 3WU 4.4 4ZD 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5VS 66C 6TJ 6TU 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABDPE ABEFU ABEML ABIJN ACAHQ ACBWZ ACCZN ACGFS ACIWK ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADZMN AEFGJ AEIGN AEIMD AENEX AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGXDD AGYGG AHBTC AIDQK AIDYY AITYG AIURR AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMVHM AMYDB ARCSS ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BNHUX BROTX BRXPI BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD F00 F01 F04 FEDTE FSPIC G-S G.N GODZA H.T H.X HBH HF~ HGLYW HHY HHZ HVGLF HZ~ H~9 IX1 J0M JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M6L MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MVM MXFUL MXSTM N04 N05 N9A NF~ NHB NNB O66 O9- OIG P2P P2W P2X P4D PALCI PQQKQ Q.N Q11 QB0 QRW R.K RIWAO RJQFR ROL RX1 RXW SAMSI SUPJJ TAE TN5 TUS TWZ UB1 V2E W8V W99 WBKPD WH7 WIB WIH WIK WJL WOHZO WQJ WXSBR WYISQ XBAML XG1 XPP XV2 ZCA ZY4 ZZTAW ~IA ~WT AAYXX AIQQE CITATION O8X 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c2949-2677e2339aa7dfdc6b6ea6dcbba5dd4f0d6a6fcedd040815a558aca6438166e93
IEDL.DBID	24P
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001546452100007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0028-3045
IngestDate	Sat Aug 23 12:57:10 EDT 2025 Sat Nov 29 07:40:36 EST 2025 Fri Aug 01 09:20:32 EDT 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	2
Language	English
License	Attribution
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c2949-2677e2339aa7dfdc6b6ea6dcbba5dd4f0d6a6fcedd040815a558aca6438166e93
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-0229-0465
OpenAccessLink	https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnet.22279
PQID	3235318646
PQPubID	1016413
PageCount	7
ParticipantIDs	proquest_journals_3235318646 crossref_primary_10_1002_net_22279 wiley_primary_10_1002_net_22279_NET22279
PublicationCentury	2000
PublicationDate	September 2025 2025-09-00 20250901
PublicationDateYYYYMMDD	2025-09-01
PublicationDate_xml	– month: 09 year: 2025 text: September 2025
PublicationDecade	2020
PublicationPlace	Hoboken, USA
PublicationPlace_xml	– name: Hoboken, USA – name: New York
PublicationTitle	Networks
PublicationYear	2025
Publisher	John Wiley & Sons, Inc Wiley Subscription Services, Inc
Publisher_xml	– name: John Wiley & Sons, Inc – name: Wiley Subscription Services, Inc
References	2025; 178 2008; 190 1987; 34 2017; 81 2025; 176 2015; 3 2021; 126 2015; 244 2007 2014; 24 2020; 54 2020; 76 2024 2021; 73 2023; 81 2022; 145 2022 1997; 31 2011; 209 1984; 35 2016; 255 2011; 89 2014 2008; 40 2014; 6 2011; 186 e_1_2_12_4_1 e_1_2_12_3_1 e_1_2_12_6_1 e_1_2_12_5_1 e_1_2_12_19_1 e_1_2_12_18_1 e_1_2_12_2_1 e_1_2_12_17_1 e_1_2_12_16_1 e_1_2_12_20_1 e_1_2_12_21_1 e_1_2_12_22_1 e_1_2_12_24_1 e_1_2_12_25_1 e_1_2_12_26_1 e_1_2_12_27_1 Papapanagiotou V. (e_1_2_12_23_1) 2014; 6 e_1_2_12_28_1 e_1_2_12_29_1 e_1_2_12_15_1 e_1_2_12_14_1 e_1_2_12_13_1 e_1_2_12_12_1 e_1_2_12_8_1 e_1_2_12_11_1 e_1_2_12_7_1 e_1_2_12_10_1 e_1_2_12_9_1
References_xml	– volume: 34 start-page: 307 issue: 3 year: 1987 end-page: 318 article-title: The Orienteering Problem publication-title: Naval Research Logistics – volume: 73 start-page: 869 year: 2021 end-page: 887 article-title: ATM Cash Replenishment Under Varying Population Coverage Requirements publication-title: Journal of the Operational Research Society – volume: 126 year: 2021 article-title: A Tabu Search Algorithm for the Probabilistic Orienteering Problem publication-title: Computers and Operations Research – volume: 76 start-page: 431 issue: 4 year: 2020 end-page: 450 article-title: Secure and Efficient Routing on Nodes, Edges, and Arcs of Simple‐Graphs and of Multi‐Graphs publication-title: Networks – volume: 190 start-page: 578 issue: 2 year: 2008 end-page: 585 article-title: Mixed Integer Formulations for the Probabilistic Minimum Energy Broadcast Problem in Wireless Networks publication-title: European Journal of Operational Research – volume: 40 start-page: 406 issue: 4 year: 2008 end-page: 421 article-title: The Orienteering Problem With Stochastic Profits publication-title: IIE Transactions – year: 2024 – start-page: 609 year: 2007 end-page: 662 – volume: 89 start-page: 434 issue: 6 year: 2011 end-page: 442 article-title: A Review of Hazards Associated With Primary Lithium and Lithium‐Ion Batteries publication-title: Process Safety and Environmental Protection – volume: 6 start-page: 16 issue: 1 year: 2014 end-page: 29 article-title: Objective Function Evaluation Methods for the Orienteering Problem With Stochastic Travel and Service Times publication-title: Journal of Applied Operational Research – volume: 186 start-page: 61 year: 2011 end-page: 81 article-title: The Orienteering Problem With Stochastic Travel and Service Times publication-title: Annals of Operations Research – volume: 244 start-page: 457 issue: 2 year: 2015 end-page: 470 article-title: Metaheuristics for the Risk‐Constrained Cash‐In‐Transit Vehicle Routing Problem publication-title: European Journal of Operational Research – volume: 24 start-page: 1485 issue: 3 year: 2014 end-page: 1506 article-title: Distributionally Robust Stochastic Knapsack Problem publication-title: SIAM Journal of Optimization – year: 2022 – start-page: 273 year: 2014 end-page: 298 – volume: 255 start-page: 315 issue: 2 year: 2016 end-page: 332 article-title: Orienteering Problem: A Survey of Recent Variants, Solution Approaches and Applications publication-title: European Journal of Operational Research – volume: 81 start-page: 269 year: 2017 end-page: 281 article-title: The Probabilistic Orienteering Problem publication-title: Computers and Operations Research – volume: 209 start-page: 1 issue: 1 year: 2011 end-page: 10 article-title: The Orienteering Problem: A Survey publication-title: European Journal of Operational Research – volume: 145 year: 2022 article-title: Exact Algorithms for the 0‐1 Time‐Bomb Knapsack Problem publication-title: Computers and Operations Research – volume: 35 start-page: 797 year: 1984 end-page: 809 article-title: Heuristic Methods Applied to Orienteering publication-title: Journal of the Operational Research Society – volume: 178 year: 2025 article-title: Model‐Based Algorithms for the 0–1 Time‐Bomb Knapsack Problem publication-title: Computers and Operations Research – volume: 31 start-page: 237 issue: 3 year: 1997 end-page: 251 article-title: Low Probability High Consequence Considerations in Routing Hazardous Material Shipments publication-title: Transportation Science – volume: 54 start-page: 470 issue: 2 year: 2020 end-page: 487 article-title: The Team Orienteering Problem With Overlaps: An Application in Cash Logistics publication-title: Transportation Science – volume: 3 start-page: 108 issue: 2 year: 2015 end-page: 114 article-title: Hybrid Sampling‐Based Evaluators for the Orienteering Problem With Stochastic Travel and Service Times publication-title: Journal of Traffic and Logistics Engineering – volume: 176 year: 2025 article-title: A Model‐Based Algorithm for the Probabilistic Orienteering Problem publication-title: Computers and Operations Research – volume: 81 start-page: 235 issue: 2 year: 2023 end-page: 252 article-title: The Hazardous Orienteering Problem publication-title: Networks – ident: e_1_2_12_26_1 doi: 10.1002/net.22129 – ident: e_1_2_12_27_1 – ident: e_1_2_12_3_1 doi: 10.1057/jors.1984.162 – ident: e_1_2_12_17_1 doi: 10.1016/j.cor.2025.107010 – ident: e_1_2_12_2_1 doi: 10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D – volume: 6 start-page: 16 issue: 1 year: 2014 ident: e_1_2_12_23_1 article-title: Objective Function Evaluation Methods for the Orienteering Problem With Stochastic Travel and Service Times publication-title: Journal of Applied Operational Research – ident: e_1_2_12_20_1 doi: 10.1016/j.cor.2020.105107 – ident: e_1_2_12_9_1 doi: 10.1080/01605682.2020.1866443 – ident: e_1_2_12_7_1 doi: 10.1016/j.ejor.2010.03.045 – ident: e_1_2_12_25_1 doi: 10.1016/j.ejor.2007.06.031 – ident: e_1_2_12_11_1 doi: 10.1002/net.21993 – ident: e_1_2_12_18_1 doi: 10.1080/07408170701592481 – ident: e_1_2_12_6_1 doi: 10.1016/j.ejor.2016.04.059 – ident: e_1_2_12_14_1 doi: 10.1287/trsc.31.3.237 – ident: e_1_2_12_15_1 doi: 10.1137/130915315 – ident: e_1_2_12_5_1 doi: 10.1007/0-306-48213-4_13 – ident: e_1_2_12_10_1 doi: 10.1287/trsc.2019.0923 – ident: e_1_2_12_12_1 doi: 10.1016/j.ejor.2015.01.040 – ident: e_1_2_12_19_1 doi: 10.1016/j.cor.2016.12.025 – ident: e_1_2_12_4_1 doi: 10.1137/1.9781611973594.ch10 – ident: e_1_2_12_13_1 doi: 10.1016/j.psep.2011.06.022 – ident: e_1_2_12_29_1 – ident: e_1_2_12_16_1 doi: 10.1016/j.cor.2022.105848 – ident: e_1_2_12_21_1 doi: 10.1016/j.cor.2024.106947 – ident: e_1_2_12_8_1 doi: 10.1002/net.22129 – ident: e_1_2_12_28_1 – ident: e_1_2_12_22_1 doi: 10.1007/s10479-011-0895-2 – ident: e_1_2_12_24_1 doi: 10.12720/jtle.3.2.108-114
SSID	ssj0011518
Score	2.401365
Snippet	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... 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...
SourceID	proquest crossref wiley
SourceType	Aggregation Database Index Database Publisher
StartPage	105
SubjectTerms	Catastrophic events Customers hazardous applications Integer programming Linear programming Mixed integer mixed integer linear programming model‐based algorithms Orienteering orienteering problems
Title	An Exact Algorithm for the Hazardous Orienteering Problem
URI	https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fnet.22279 https://www.proquest.com/docview/3235318646
Volume	86
WOSCitedRecordID	wos001546452100007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVWIB databaseName: Wiley Online Library - Journals customDbUrl: eissn: 1097-0037 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011518 issn: 0028-3045 databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_MzYMe_BancwTx4KWuTdo0wdPQjR1kDpngreSrOtBNtk7Ev940Xec8CIK3HpIQfn0fP_r6fg_gnFAeKB1yj2EpvFBT32OCcU8ERnHFfEWIcsMm4n6fPT7yQQWuyl6YQh9i-cEt9wwXr3MHF3LWWhENNdll3sjJ16AWBCTOTRqHg2UJwaYyVkow5-XAUlbIx63l1p_J6JthrvJUl2i62_-64g5sLfglahcGsQsVM96DzRXVwX3g7THqfAiVofbL02Q6yp5fkaWuyFJB1BOf1mQm8xm6ywWQs2IPGhRjZw7godsZXve8xQQFT2FuXwCmcWwwIVyIWKdaUUmNoFpJKSKtw9TXVNBUGa2tL7MgElHEhBI0dOVEw8khVMeTsTkCJFOWypQEODUkjJQNTkEsY0Ow5L5WhNbhrIQyeSuEMpJCEhknFofE4VCHRglysvCVWUIwsYGA0dCeceHg_P2ApN8Zuofjvy89gQ2cD-11P4Y1oJpN5-YU1tV7NppNm85omlC7ue8-3H4BjKHFug
linkProvider	Wiley-Blackwell
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PS8MwFH7MTVAP_hanU4N48FLXJm2agJehGxPnHLKBt5ImqQ60k60T8a83bdc5D4LgrYckhK_vx0de8j2AM0K5I5XLLYZDYbmK2hYTjFvC0ZJLZktCZNZswu922eMj75XgsngLk-tDzA_cUs_I4nXq4OmBdH1BNVQnF-lLTr4EFdeYkVeGyvVDa9CZVxFMNmOFCnNaESyUhWxcn0_-mY--SeYiVc1yTWvjf7vchPUZx0SN3Ci2oKTjbVhbUB7cAd6IUfNDyAQ1Xp5G42Hy_IoMfUWGDqK2-DRmM5pO0H0qgpzkc1Avbz2zC4NWs3_VtmZdFCyJufkJmPq-xoRwIXwVKUlDqgVVMgyFp5Qb2YoKGkmtlPFn5njC85iQgrpZSVFzsgfleBTrfUBhxKIwIg6ONHE9aQKU44e-JjjktpKEVuG0wDJ4y8UyglwWGQcGhyDDoQq1AuVg5i-TgGBiggGjrlnjPMPz9wWCbrOffRz8fegJrLT7d52gc9O9PYRVnDbxzS6K1aCcjKf6CJblezKcjI9nNvQFyeTJlw
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFH_MKaIHv8X5GcSDl7o2adMEvAzdmCh1hwm7lTRJdaDb2DoR_3rTdJ3zIAjeekhC-PV9_Ojr-z2AC0K5J5XPHYYT4fiKug4TjDvC05JL5kpCpB02EUYR6_V4pwLXZS9MoQ8x_-CWe4aN17mD65FK6wuqoTq7yjs5-RIs-4GJsbmus9-Z1xBMLmOlBnNeDyx1hVxcn2_9mY2-KeYiUbWZprX5vztuwcaMYaJGYRLbUNGDHVhf0B3cBd4YoOaHkBlqvD4Px_3s5Q0Z8ooMGURt8WmMZjidoMdcAjkr9qBOMXhmD55aze5N25nNUHAk5uYVYBqGGhPChQhVqiRNqBZUySQRgVJ-6ioqaCq1UsabmReIIGBCCurbgqLmZB-qg-FAHwBKUpYmKfFwqokfSBOevDAJNcEJd5UktAbnJZbxqJDKiAtRZBwbHGKLQw2OS5TjmbdMYoKJCQWM-uaMS4vn7wfEUbNrHw7_vvQMVju3rfjhLro_gjWcT_C1f4kdQzUbT_UJrMj3rD8Zn1oD-gIHDMeA
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Exact+Algorithm+for+the+Hazardous+Orienteering+Problem&rft.jtitle=Networks&rft.au=Montemanni%2C+Roberto&rft.au=Smith%2C+Derek+H.&rft.date=2025-09-01&rft.pub=John+Wiley+%26+Sons%2C+Inc&rft.issn=0028-3045&rft.eissn=1097-0037&rft.volume=86&rft.issue=2&rft.spage=105&rft.epage=111&rft_id=info:doi/10.1002%2Fnet.22279&rft.externalDBID=10.1002%252Fnet.22279&rft.externalDocID=NET22279
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0028-3045&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0028-3045&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0028-3045&client=summon