A three-phased local search approach for the clique partitioning problem (Q306093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: M. Dambrine / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6620838 / rank
 
Normal rank
Property / zbMATH Keywords
 
clique partitioning
Property / zbMATH Keywords: clique partitioning / rank
 
Normal rank
Property / zbMATH Keywords
 
restricted neighborhood
Property / zbMATH Keywords: restricted neighborhood / rank
 
Normal rank
Property / zbMATH Keywords
 
tabu search
Property / zbMATH Keywords: tabu search / rank
 
Normal rank
Property / zbMATH Keywords
 
direct perturbation
Property / zbMATH Keywords: direct perturbation / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristic
Property / zbMATH Keywords: heuristic / rank
 
Normal rank

Revision as of 23:01, 27 June 2023

scientific article
Language Label Description Also known as
English
A three-phased local search approach for the clique partitioning problem
scientific article

    Statements

    A three-phased local search approach for the clique partitioning problem (English)
    0 references
    0 references
    0 references
    31 August 2016
    0 references
    clique partitioning
    0 references
    restricted neighborhood
    0 references
    tabu search
    0 references
    direct perturbation
    0 references
    heuristic
    0 references

    Identifiers