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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1080/09720502.2003.10700340
+Normal rank
@@ Property / OpenAlex ID @@
+W2326956046
@@ Property / OpenAlex ID: W2326956046 / rank @@
+Normal rank
@@ Property / cites work @@
+Designing a Uniform Random Number Generator Whose Subsequences are <i>k</i>-Distributed
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Heuristic Procedures for Integer Linear Programming with an Interior
+Normal rank
@@ Property / cites work @@
+A genetic algorithm for chance constrained programming
+Normal rank
@@ Property / cites work @@
+Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
+Normal rank
@@ Property / cites work @@
+Set Covering by an All Integer Algorithm
@@ Property / cites work: Set Covering by an All Integer Algorithm / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4469109