Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607): 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: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a feasible course schedule using Tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved tabu search approach for solving the job shop scheduling problem with tooling constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(02)00823-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966208092 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Guidelines for the use of meta-heuristics in combinatorial optimization.
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references