Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843): 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/s10479-012-1124-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094836579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for modeling and solving set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive and dynamic local search for max-clique: engineering effective building blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with edge weighting and configuration checking heuristics for minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP for set packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood portfolio approach for local search applied to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search / rank
 
Normal rank
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: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data dependent worst case bounds for weighted set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmentation algorithm for the maximum weighted stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the maximum vertex/edge weighted clique using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive multistart tabu search approach to solve the maximum clique problem / rank
 
Normal rank

Latest revision as of 21:01, 5 July 2024

scientific article
Language Label Description Also known as
English
Multi-neighborhood tabu search for the maximum weight clique problem
scientific article

    Statements

    Multi-neighborhood tabu search for the maximum weight clique problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    multi-neighborhood search
    0 references
    maximum weight clique
    0 references
    maximum clique
    0 references
    tabu search
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers