Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161): Difference between revisions

From MaRDI portal
Changed an 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: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.1016/j.cor.2003.09.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069895684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction heuristics for the asymmetric TSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / 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 implementation of the Lin-Kernighan traveling salesman heuristic / 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: A modified Lin--Kernighan traveling-salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: New edges not used in shortest tours of TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank

Latest revision as of 14:40, 10 June 2024

scientific article
Language Label Description Also known as
English
Determination of the candidate arc set for the asymmetric traveling salesman problem
scientific article

    Statements

    Determination of the candidate arc set for the asymmetric traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    traveling salesman
    0 references
    candidate arc set
    0 references
    out-of-kilter
    0 references
    heuristic
    0 references
    0 references
    0 references
    0 references
    0 references