Solving the moving target search problem using indistinguishable searchers
type: Item
instance of: scholarly article
title: Solving the moving target search problem using indistinguishable searchers
zbMATH Open document ID: 1430.90307
author: François-Alex Bourque
published in: European Journal of Operational Research
publication date: 2019-01-18T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7003092
zbMATH Keywords: OR in defence
zbMATH Keywords: search theory
zbMATH Keywords: integer programming
zbMATH Keywords: branch and bound
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.11.006
OpenAlex ID: W2900784984
cites work: Q3649086
cites work: Q4225395
cites work: Using multiple searchers in constrained-path, moving-target search problems
cites work: The Optimal Search for a Moving Target When the Search Path Is Constrained
cites work: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
cites work: Q3833854
cites work: Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
cites work: A polynomial time primal network simplex algorithm for minimum cost flows
cites work: Route optimization for multiple searchers
cites work: Technical Note—The Complexity of the Optimal Searcher Path Problem
cites work: Branch and bound methods for a search problem
Wikidata QID: Q128913978
DOI: 10.1016/J.EJOR.2018.11.006
description: scientific article; zbMATH DE number 7003092