GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2012.10.001 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: PERL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TTTPLOTS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
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: GRASP / 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.1016/j.cor.2012.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031673408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An emergency vehicle dispatching system for an electric utility in Chile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Procedures for travelling salesman problems with additional constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of the clustered travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted delivery problems on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for the Traveling Salesman Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Christofides' heuristic: some paths are more difficult than cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP – Part I: Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of scatter search / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and path relinking for the max-min diversity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2012.10.001 / rank
 
Normal rank

Latest revision as of 14:47, 9 December 2024

scientific article
Language Label Description Also known as
English
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
scientific article

    Statements

    GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    combinatorial optimization
    0 references
    clustered traveling salesman problem
    0 references
    heuristics
    0 references
    path relinking
    0 references
    GRASP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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