A genetic algorithm for the set covering problem (Q1278326): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / 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: Enhancing an algorithm for set covering problems / 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: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient heuristic for large set covering problems / rank
 
Normal rank

Latest revision as of 18:31, 28 May 2024

scientific article
Language Label Description Also known as
English
A genetic algorithm for the set covering problem
scientific article

    Statements