A penalty search algorithm for the obstacle neutralization problem
From MaRDI portal
Publication:337275
DOI10.1016/j.cor.2014.08.013zbMath1348.90588OpenAlexW2061781505MaRDI QIDQ337275
Ali Fuat Alkaya, Vural Aksakalli, Carey E. Priebe
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.08.013
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Search space reduction in QoS routing.
- Optimal obstacle placement with disambiguations
- Algorithms for the Weight Constrained Shortest Path Problem
- Flight String Models for Aircraft Fleeting and Routing
- The reset disambiguation policy for navigating stochastic obstacle fields
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
- Aircraft routing under the risk of detection
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- An algorithm for the resource constrained shortest path problem
- A dual algorithm for the constrained shortest path problem
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem
- Random disambiguation paths for traversing a mapped hazard field
This page was built for publication: A penalty search algorithm for the obstacle neutralization problem