Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (Q2427183): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2007.06.043 / rank
Normal rank
 
Property / author
 
Property / author: H. Y. Lau / rank
Normal rank
 
Property / author
 
Property / author: H. Y. Lau / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065549538 / 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: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of a Markovian target with optimization of the search efforts under generalized linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Honey-pot constrained searching with local sensory information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using multiple searchers in constrained-path, moving-target search problems / 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: Optimal strategy of route and look for the path constrained search problem with reward criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Sequential Search with Positive Switch Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria and approximate methods for path-constrained moving-target search problems / 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: Branch and bound methods for a search problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2007.06.043 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:53, 18 December 2024

scientific article
Language Label Description Also known as
English
Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
scientific article

    Statements

    Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times (English)
    0 references
    0 references
    0 references
    0 references
    8 May 2008
    0 references
    search theory
    0 references
    branch and bound
    0 references
    global optimisation
    0 references
    Markov processes
    0 references

    Identifiers