Solving the moving target search problem using indistinguishable searchers

DOI10.1016/j.ejor.2018.11.006zbMath1430.90307OpenAlexW2900784984WikidataQ128913978 ScholiaQ128913978MaRDI QIDQ1711443

François-Alex Bourque

Publication date: 18 January 2019

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.006

zbMATH Keywords

integer programmingbranch and boundsearch theoryOR in defence

Mathematics Subject Classification ID

Integer programming (90C10) Search theory (90B40)

Related Items (1)

Planning a multi-sensors search for a moving target considering traveling costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial time primal network simplex algorithm for minimum cost flows
• Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
• Route optimization for multiple searchers
• The Optimal Search for a Moving Target When the Search Path Is Constrained
• Branch and bound methods for a search problem
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Using multiple searchers in constrained-path, moving-target search problems
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: Solving the moving target search problem using indistinguishable searchers