Investigating the benefits of re-optimisation while searching for two immobile entities on a network

DOI10.1504/IJMOR.2009.022875zbMath1176.90266OpenAlexW2110992643MaRDI QIDQ843390

Arun Jotshi, Rajan Batta

Publication date: 12 October 2009

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2009.022875

zbMATH Keywords

search problemsundirected networkimmobile entitiesre-optimisation

Mathematics Subject Classification ID

Search theory (90B40) Deterministic network models in operations research (90B10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Minimizing the average searching time for an object within a graph

This page was built for publication: Investigating the benefits of re-optimisation while searching for two immobile entities on a network