Multi-start iterated tabu search for the minimum weight vertex cover problem (Q306082): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-015-9909-3 / 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/s10878-015-9909-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1873423029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the partial vertex cover problem in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated tabu search for the circular open dimension problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive tabu search for course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient fixed-parameter algorithms for weighted vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search/path relinking algorithm to solve the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization algorithm for the minimum weight vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation of the connected set-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum vertex cover in ball graphs through local search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-015-9909-3 / rank
 
Normal rank

Latest revision as of 13:52, 9 December 2024

scientific article
Language Label Description Also known as
English
Multi-start iterated tabu search for the minimum weight vertex cover problem
scientific article

    Statements

    Multi-start iterated tabu search for the minimum weight vertex cover problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    31 August 2016
    0 references
    minimum weight vertex cover problem
    0 references
    tabu search
    0 references
    fast evaluation strategy
    0 references
    perturbation
    0 references
    meta-heuristic
    0 references

    Identifiers