Heuristics for the Canadian traveler problem with neutralizations
Authors:
- Ali Fuat AlkayaAAAli Fuat Alkaya
- Serkan YildirimSYSerkan Yildirim
- Vural AksakalliVAVural Aksakalli
- 1 September 2021
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 159
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- The reset disambiguation policy for navigating stochastic obstacle fieldsNaval Research Logistics (NRL), 2011
- Probabilistic planning with clear preferences on missing informationArtificial Intelligence, 2009
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problemNetworks, 2009
- The canadian traveller problem and its competitive analysisJournal of Combinatorial Optimization, 2008
- Lagrangian relaxation and enumeration for solving constrained shortest‐path problemsNetworks, 2008
- Aircraft routing under the risk of detectionNaval Research Logistics (NRL), 2006
- Random disambiguation paths for traversing a mapped hazard fieldNaval Research Logistics (NRL), 2005
- Shortest paths without a mapTheoretical Computer Science, 1991
- An algorithm for the resource constrained shortest path problemNetworks, 1989
- A dual algorithm for the constrained shortest path problemNetworks, 1980