An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem (Q5752282)

From MaRDI portal
Revision as of 01:39, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4187446
Language Label Description Also known as
English
An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem
scientific article; zbMATH DE number 4187446

    Statements

    An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem (English)
    0 references
    0 references
    0 references
    1990
    0 references
    true lower bound
    0 references
    constrained path, moving target search problem
    0 references
    discrete time
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references