An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(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: Q3138882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / 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: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A man-machine approach toward solving the traveling salesman problem / 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: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Examples of Difficult Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hill Climbing with Multiple Local Optima / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric traveling salesman problem and edge exchanges in minimal 1- trees / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00334-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1982298984 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:53, 30 July 2024

scientific article
Language Label Description Also known as
English
An empirical study of a new metaheuristic for the traveling salesman problem
scientific article

    Statements

    An empirical study of a new metaheuristic for the traveling salesman problem (English)
    0 references
    0 references
    0 references
    22 February 2001
    0 references
    0 references
    traveling salesman
    0 references
    heuristics
    0 references
    computational analysis
    0 references
    0 references