Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (Q5278229): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: First vs. best improvement: an empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood search: methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-neighborhood tabu search for the maximum weight clique problem / rank
 
Normal rank

Latest revision as of 03:35, 14 July 2024

scientific article; zbMATH DE number 6744663
Language Label Description Also known as
English
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
scientific article; zbMATH DE number 6744663

    Statements

    Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    0 references
    neighborhood structures
    0 references
    variable neighborhood descent
    0 references
    variable neighborhood search
    0 references
    TSP
    0 references
    empirical study
    0 references
    0 references