A framework for analyzing sub-optimal performance of local search algorithms (Q548682): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(11 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-009-9290-1 / rank
Normal rank
 
Property / author
 
Property / author: Jacobson, Sheldon H. / rank
Normal rank
 
Property / author
 
Property / author: Jacobson, Sheldon H. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5915212 / rank
 
Normal rank
Property / zbMATH Keywords
 
convergence
Property / zbMATH Keywords: convergence / rank
 
Normal rank
Property / zbMATH Keywords
 
finite-time performance
Property / zbMATH Keywords: finite-time performance / rank
 
Normal rank
Property / zbMATH Keywords
 
simulated annealing
Property / zbMATH Keywords: simulated annealing / rank
 
Normal rank
Property / zbMATH Keywords
 
tabu search
Property / zbMATH Keywords: tabu search / rank
 
Normal rank
Property / zbMATH Keywords
 
Lin-Kernighan-Helsgaun algorithm
Property / zbMATH Keywords: Lin-Kernighan-Helsgaun algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
travelling salesman problem
Property / zbMATH Keywords: travelling salesman problem / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
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.1007/s10589-009-9290-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969481946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: The Theory and Practice of Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5586854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of convergent generalized hill climbing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of generalized hill climbing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search performance on the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3951448 / 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: Using Markov chains to analyze the effectiveness of local search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-time performance analysis of static simulated annealing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study of a new metaheuristic for the traveling salesman problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-009-9290-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:12, 9 December 2024

scientific article
Language Label Description Also known as
English
A framework for analyzing sub-optimal performance of local search algorithms
scientific article

    Statements

    A framework for analyzing sub-optimal performance of local search algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    convergence
    0 references
    finite-time performance
    0 references
    simulated annealing
    0 references
    tabu search
    0 references
    Lin-Kernighan-Helsgaun algorithm
    0 references
    travelling salesman problem
    0 references
    0 references
    0 references
    0 references

    Identifiers