A computational study of a genetic algorithm to solve the set covering problem (Q4469109): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Designing a Uniform Random Number Generator Whose Subsequences are <i>k</i>-Distributed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Heuristic Procedures for Integer Linear Programming with an Interior / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for chance constrained programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Covering by an All Integer Algorithm / rank
 
Normal rank

Latest revision as of 17:53, 6 June 2024

scientific article; zbMATH DE number 2074081
Language Label Description Also known as
English
A computational study of a genetic algorithm to solve the set covering problem
scientific article; zbMATH DE number 2074081

    Statements