An effective and simple heuristic for the set covering problem (Q853015): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973727721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An indirect genetic algorithm for set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037131 / 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: 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: A genetic algorithm for the set covering problem / 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 Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian-based heuristic for large-scale set covering problems / 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: Using experimental design to find effective parameter settings for heuristics / 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: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842748 / 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: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: A local-search heuristic for large set-covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient mean field approach to the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized approximation of bounded multicovering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank

Latest revision as of 22:07, 24 June 2024

scientific article
Language Label Description Also known as
English
An effective and simple heuristic for the set covering problem
scientific article

    Statements

    An effective and simple heuristic for the set covering problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    combinatorial optimization
    0 references
    set covering
    0 references
    Meta-RaPS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers