Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382)

From MaRDI portal
Revision as of 09:47, 20 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Multitask \(n\)-vehicle exploration problem: complexity and algorithm
scientific article

    Statements

    Multitask \(n\)-vehicle exploration problem: complexity and algorithm (English)
    0 references
    27 January 2014
    0 references
    multitask \(n\)-vehicle exploration problem (MTNVEP)
    0 references
    NP-hard
    0 references
    strongly NP-hard
    0 references
    heuristic algorithm
    0 references

    Identifiers