Metaheuristic downhill simplex method in combinatorial optimization (Q941194): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-007-0106-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006721481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Heterogeneous Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: QAPLIB - a quadratic assignment problem library / rank
 
Normal rank

Latest revision as of 16:08, 28 June 2024

scientific article
Language Label Description Also known as
English
Metaheuristic downhill simplex method in combinatorial optimization
scientific article

    Statements

    Metaheuristic downhill simplex method in combinatorial optimization (English)
    0 references
    0 references
    0 references
    4 September 2008
    0 references
    0 references
    combinatorial optimization problem
    0 references
    metaheuristic algorithms
    0 references
    stochastic local search
    0 references
    parallel computations
    0 references
    cluster
    0 references
    quadratic assignment problem
    0 references
    0 references