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
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/s10255-008-8811-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982197415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well solvable cases of the quadratic assignment problem with monotone and bimonotone matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3640530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:40, 2 July 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
    0 references