Optimal strategy of route and look for the path constrained search problem with reward criterion (Q1278090): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search for a Moving Target in Discrete Time and Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE OPTIMAL SEARCH PLAN FOR A MOVING TARGET MINIMIZING THE EXPECTED RISK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—The Complexity of the Optimal Searcher Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search for a Moving Target: The FAB Algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:29, 28 May 2024

scientific article
Language Label Description Also known as
English
Optimal strategy of route and look for the path constrained search problem with reward criterion
scientific article

    Statements

    Optimal strategy of route and look for the path constrained search problem with reward criterion (English)
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    0 references
    0 references
    0 references
    0 references
    military
    0 references
    search theory
    0 references
    branch and bound method
    0 references
    integer programming
    0 references
    combinatorial analysis
    0 references