Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10732-012-9194-6 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-012-9194-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995945236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Maximum Scatter Traveling Salesperson Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Bottleneck Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3955398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck extrema / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bottleneck Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / 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: Q4461911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a bottleneck traveling salesman problem / 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 linear time algorithm for the bottleneck biconnected spanning subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guaranteed performance heuristics for the bottleneck traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic algorithm for the bottleneck traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Flow-Shop Sequencing Problem with No Wait in Process<sup>†</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the minimax problem of the travelling salesman. II: Dual approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Gilmore-Gomory's open question for the bottleneck TSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10732-012-9194-6 / rank
 
Normal rank

Latest revision as of 20:14, 9 December 2024

scientific article
Language Label Description Also known as
English
Experimental analysis of heuristics for the bottleneck traveling salesman problem
scientific article

    Statements

    Experimental analysis of heuristics for the bottleneck traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    traveling salesman problem
    0 references
    bottleneck TSP
    0 references
    experimental analysis
    0 references
    maximum scatter TSP
    0 references
    heuristic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers