Nonoblivious 2-Opt heuristics for the traveling salesman problem (Q2811309): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
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.1002/net.21512 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047057401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New local search approximation techniques for maximum generalized satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Approximation Results for Local Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Old <i>k</i>-opt Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Rounding Approach to the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Syntactic versus Computational Views of Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical aspects of local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Local Search in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 03:01, 12 July 2024

scientific article
Language Label Description Also known as
English
Nonoblivious 2-Opt heuristics for the traveling salesman problem
scientific article

    Statements

    Nonoblivious 2-Opt heuristics for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    TSP
    0 references
    2-opt
    0 references
    local search
    0 references
    heuristics
    0 references
    performance guarantees
    0 references
    approximation algorithms
    0 references
    0 references
    0 references

    Identifiers

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