Genetic algorithms and traveling salesman problems (Q1268132): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/0377-2217(95)00077-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130137264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Traveling Salesman Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / 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: Quick updates for \(p\)-opt TSP heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution algorithms in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank

Latest revision as of 15:48, 28 May 2024

scientific article
Language Label Description Also known as
English
Genetic algorithms and traveling salesman problems
scientific article

    Statements

    Genetic algorithms and traveling salesman problems (English)
    0 references
    0 references
    0 references
    0 references
    18 October 1998
    0 references
    genetic algorithm
    0 references
    asexual reproduction plan
    0 references
    traveling salesman
    0 references

    Identifiers