Compounded genetic algorithms for the quadratic assignment problem (Q2488198): 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.1016/j.orl.2004.11.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992562824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy genetic algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Genetic Algorithm for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extended concentric tabu for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking scalar products to improve bounds for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of iterative searches for the quadratic assignment problem / rank
 
Normal rank

Revision as of 14:33, 10 June 2024

scientific article
Language Label Description Also known as
English
Compounded genetic algorithms for the quadratic assignment problem
scientific article

    Statements

    Identifiers

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