A GRASP algorithm to solve the unicost set covering problem (Q878597): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRASP / 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.2005.11.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156557985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Location of Emergency Service Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing an algorithm for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate heuristic for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel genetic algorithm to solve the set-covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-flip neighborhood local search for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptation of SH heuristic to the location set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with approximation algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for SAT: an empirical evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment / rank
 
Normal rank

Latest revision as of 18:13, 25 June 2024

scientific article
Language Label Description Also known as
English
A GRASP algorithm to solve the unicost set covering problem
scientific article

    Statements

    A GRASP algorithm to solve the unicost set covering problem (English)
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    0 references
    set covering
    0 references
    optimization
    0 references
    constraint satisfaction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references