论文信息 - Solving large set covering problems on a personal computer

Solving large set covering problems on a personal computer

Abstract The set covering problem (SCP) was one of the first problems shown to be NP-complete. Heuristics are commonly used on mainframe computers in order to efficiently solve large-scale SCPs. In this paper, we use a new heuristic and several existing heuristics written in FORTRAN to solve 31 large (up to 2000 variables) SCPs on an IBM PC/AT. The new heuristic, SCAMP (set covering algorithm for the microprocessor), performed the best, with solution values deviating only an average 1.8% from the optimum.

Francis J. Vasko | Floyd E. Wolf | F. E. Wolf

[1] F. J. Vasko,et al. Hybrid heuristics for minimum cardinality set covering problems , 1986 .

[2] A. C. McKay. Linear Programming Applications on Microcomputers , 1985 .

[3] Edward K. Baker,et al. Efficient heuristic algorithms for the weighted set covering problem , 1981, Comput. Oper. Res..

[4] John Murdoch. Forecasting and Inventory Control on Micros , 1985 .

[5] Francis J. Vasko,et al. Using a facility location algorithm to solve large set covering problems , 1984 .

[6] Francis J. Vasko,et al. An efficient heuristic for large set covering problems , 1984 .

[7] R. Roth,et al. Computer Solutions to Minimum-Cover Problems , 1969, Oper. Res..

[8] Andrew C. Ho,et al. Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[9] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[10] S. C. Mathewson. Simulation Program Generators: Code and Animation on a P.C. , 1985 .

[11] Terry P. Harrison,et al. Micro Versus Mainframe Performance for a Selected Class of Mathematical Programming Problems , 1985 .

[12] John Bowers. Network Analysis on a Micro , 1985 .

[13] Frederick P. Wheeler. A Starter Kit for Micro-Based L.P. Solvers , 1985 .