Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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-011-0312-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968709147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum mechanical algorithms for the nonabelian hidden subgroup problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multicovering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with general cutting planes for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank

Latest revision as of 23:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Experiments with LAGRASP heuristic for set \(k\)-covering
scientific article

    Statements

    Experiments with LAGRASP heuristic for set \(k\)-covering (English)
    0 references
    30 November 2012
    0 references
    0 references
    GRASP
    0 references
    hybrid heuristics
    0 references
    metaheuristics
    0 references
    path-relinking
    0 references
    Lagrangean relaxation
    0 references
    Lagrangean heuristics
    0 references
    local search
    0 references
    set covering
    0 references
    set multicovering
    0 references
    set \(k\)-covering
    0 references
    0 references