Concepedia
Publication | Closed Access
Algorithms for the Set Covering Problem
413
Citations
26
References
2000
Year
Knapsack Problems: Algorithms and Computer Implementations
David Connolly, Silvano Martello, Paolo Toth
Journal of the Operational Research Society
1991
3.2K
OR-Library: Distributing Test Problems by Electronic Mail
J. E. Beasley
1990
1.9K
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held, Richard M. Karp
Operations Research
Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringPathfindingNew Approaches +16
1970
1.4K
The traveling-salesman problem and minimum spanning trees: Part II
Mathematical Programming
Mathematical ProgrammingEngineeringGraph TheoryTraveling Salesman ProblemCombinatorial Problem +6
1971
1K
On the hardness of approximating minimization problems
Carsten Lund, Mihalis Yannakakis
Journal of the ACM
1994
882
Performance of various computers using standard linear equations software
Jack Dongarra
ACM SIGARCH Computer Architecture News
Numerical AnalysisMathematical ProgrammingEngineeringComputer ArchitectureHigh Performance Computing +16
1992
713
An Applications Oriented Guide to Lagrangian Relaxation
Marshall L. Fisher
INFORMS Journal on Applied Analytics
Mathematical ProgrammingNumerical AnalysisLarge-scale Global OptimizationEngineeringVariational Analysis +16
1985
639
A genetic algorithm for the set covering problem
J. E. Beasley, P.C. Chu
European Journal of Operational Research
Covering ProblemsEngineeringCombinatory AnalysisCombinatorial ProblemGenetic Algorithm +4
1996
623
A Genetic Algorithm for the Set Covering Problem
K. S. Al-Sultan, Mohammed F. Hussain, J. S. Nizami
535
A Heuristic Method for the Set Covering Problem
Alberto Caprara, Matteo Fischetti, Paolo Toth
Mathematical ProgrammingEngineeringComputational ComplexitySet Covering ProblemDiscrete Optimization +19
1999
420
Page 1