A parallel genetic algorithm to solve the set-covering problem (Q1603319): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling 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: Simplification of the Covering Problem with Application to Boolean Expressions / 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: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 0,1 facets of the set covering polytope / 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: On the facial structure of the set covering polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0305-0548(01)00026-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2053740074 / rank
 
Normal rank

Latest revision as of 10:24, 30 July 2024

scientific article
Language Label Description Also known as
English
A parallel genetic algorithm to solve the set-covering problem
scientific article

    Statements

    A parallel genetic algorithm to solve the set-covering problem (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references