A study of diversification strategies for the quadratic assignment problem (Q1342106): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel tabu search algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth Packing: A Tabu Search Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for assignment problems on an array processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of a tabu search adaptation to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying tabu search with influential diversification to multiprocessor scheduling / rank
 
Normal rank

Latest revision as of 10:19, 23 May 2024

scientific article
Language Label Description Also known as
English
A study of diversification strategies for the quadratic assignment problem
scientific article

    Statements

    Identifiers