Divide and conquer strategies for parallel TSP heuristics (Q1919776): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0305-0548(95)00066-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978177608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / 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: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / 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: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel tabu search algorithm for large 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: Fast Algorithms for Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Heuristics for Large Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel complexity of TSP heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic expected performance of some TSP heuristics: An empirical evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistical Evaluation of Multiplicative Congruential Random Number Generators with Modulus 2 31 - 1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:42, 24 May 2024

scientific article
Language Label Description Also known as
English
Divide and conquer strategies for parallel TSP heuristics
scientific article

    Statements

    Divide and conquer strategies for parallel TSP heuristics (English)
    0 references
    0 references
    24 July 1996
    0 references
    0 references
    geometric traveling salesman problem
    0 references
    divide und conquer strategies
    0 references
    parallel heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references