Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2017.03.016 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BHOSLIB / 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.1016/j.cor.2017.03.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2604863078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear formulation for the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: OMEGA one multi ethnic genetic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / 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: Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the minimum labelling spanning tree problem using hybrid local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop 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: Looking ahead with the pilot method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-start iterated tabu search for the minimum weight vertex cover problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2017.03.016 / rank
 
Normal rank

Latest revision as of 01:06, 11 December 2024

scientific article
Language Label Description Also known as
English
Carousel greedy: a generalized greedy algorithm with applications in optimization
scientific article

    Statements

    Carousel greedy: a generalized greedy algorithm with applications in optimization (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    metaheuristics
    0 references
    greedy algorithm
    0 references
    combinatorial optimization
    0 references
    minimum label spanning tree
    0 references
    vertex cover
    0 references
    independent set
    0 references
    iterated greedy
    0 references
    carousel greedy
    0 references
    0 references
    0 references

    Identifiers