Minimizing the average searching time for an object within a graph

DOI10.1007/S10589-019-00121-WzbMath1432.90156OpenAlexW2965450087MaRDI QIDQ2007833

Ron Teller, Moshe Zofi, Moshe Kaspi

Publication date: 22 November 2019

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-019-00121-w

zbMATH Keywords

TSPdynamic programmingbranch and boundgreedy algorithmheuristic searchant colony optimizationgraph search algorithmsobject searching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal search path for service in the presence of disruptions
• Investigating the benefits of re-optimisation while searching for two immobile entities on a network
• Search for an immobile entity on a network
• Theory of optimal search
• A branch-and-price algorithm for the minimum latency problem
• Sequential testing of complex systems: a review
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• On the linear search problem
• Path optimization for the resource-constrained searcher
• The complexity of the travelling repairman problem
• Optimal search for a randomly moving object
• Optimal Search for a Moving Target in Discrete Time and Space
• P-Complete Approximation Problems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• The Rendezvous Search Problem

This page was built for publication: Minimizing the average searching time for an object within a graph