A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1007/s10878-005-4921-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006965378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for 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: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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: Expanding neighborhood GRASP for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350076 / rank
 
Normal rank

Latest revision as of 14:13, 11 June 2024

scientific article
Language Label Description Also known as
English
A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
scientific article

    Statements

    A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    13 January 2006
    0 references
    traveling salesman problem
    0 references
    genetic algorithms
    0 references
    metaheuristics
    0 references
    Lagrangean relaxation
    0 references
    greedy randomized adaptive search procedure
    0 references

    Identifiers