A hybrid heuristic for the set covering problem (Q373244): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s12351-010-0086-y / 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: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm / 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: Logical analysis of numerical data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated 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: A Lagrangian-based heuristic for large-scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398380 / 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: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A comparative study of artificial bee colony algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective and simple heuristic 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: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-flip neighborhood local search for the set covering problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S12351-010-0086-Y / rank
 
Normal rank

Latest revision as of 15:39, 9 December 2024

scientific article
Language Label Description Also known as
English
A hybrid heuristic for the set covering problem
scientific article

    Statements

    A hybrid heuristic for the set covering problem (English)
    0 references
    0 references
    0 references
    22 October 2013
    0 references
    artificial bee colony algorithm
    0 references
    combinatorial optimization
    0 references
    heuristic
    0 references
    set covering problem
    0 references
    swarm intelligence
    0 references
    0 references
    0 references
    0 references

    Identifiers