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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11424-012-9324-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989000650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3640530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5754462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Strong Equilibrium in Job Scheduling Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank

Latest revision as of 06:24, 7 July 2024

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
    0 references
    0 references

    Identifiers