A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-017-1128-7 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SubMAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-017-1128-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2594540369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for the maximum independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum weighted independent set in an arbitrary graph / 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: Q4547547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach for the maximum weight independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithmic approach to find the maximum weight independent set of a graph / 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: Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-neighborhood tabu search for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for maximum clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum vertex weight clique problem via binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for cluster editing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-017-1128-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:04, 11 December 2024

scientific article
Language Label Description Also known as
English
A hybrid iterated local search heuristic for the maximum weight independent set problem
scientific article

    Statements

    A hybrid iterated local search heuristic for the maximum weight independent set problem (English)
    0 references
    0 references
    0 references
    28 May 2018
    0 references
    maximum weight independent set
    0 references
    maximum weight clique
    0 references
    minimum weight vertex cover
    0 references
    iterated local search
    0 references
    metaheuristics
    0 references

    Identifiers