A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 10:21, 2 February 2024

scientific article
Language Label Description Also known as
English
A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem
scientific article

    Statements

    A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (English)
    0 references
    0 references
    0 references
    1 March 2010
    0 references
    complexity of computation
    0 references
    combinatorial optimization
    0 references
    \(N\)-vehicle problem
    0 references
    permutations
    0 references
    inverse order
    0 references

    Identifiers

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