A parallel tabu search algorithm for large traveling salesman problems (Q1329785): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127908973, #quickstatements; #temporary_batch_1722635374576
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5729634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A thermodynamically motivated simulation procedure for combinatorial optimization problems / 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
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: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tabu search metaheuristic: How we used it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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 parallel shortest path algorithm / 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: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(92)00033-i / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095546721 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127908973 / rank
 
Normal rank

Latest revision as of 22:50, 2 August 2024

scientific article
Language Label Description Also known as
English
A parallel tabu search algorithm for large traveling salesman problems
scientific article

    Statements

    Identifiers