The noising methods: A generalization of some metaheuristics (Q5954829): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of ``threshold accepting'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838673 / 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: Local search with perturbations for the prize-collecting Steiner tree problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising method: A new method for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of the noising method to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lamarckian genetic algorithms applied to the aggregation of preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noising methods for a clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-tuning of the noising methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic to solve a task allocation problem / 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: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering of XML documents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tour construction heuristic for the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / 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: Q4350034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General local search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified noising algorithm for the graph partitioning problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(00)00305-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012071970 / rank
 
Normal rank

Latest revision as of 08:53, 30 July 2024

scientific article; zbMATH DE number 1702059
Language Label Description Also known as
English
The noising methods: A generalization of some metaheuristics
scientific article; zbMATH DE number 1702059

    Statements

    The noising methods: A generalization of some metaheuristics (English)
    0 references
    0 references
    0 references
    2001
    0 references
    Combinatorial optimization
    0 references
    Metaheuristics
    0 references
    Local search methods
    0 references
    Noising methods
    0 references
    Simulated annealing
    0 references
    Threshold accepting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers