Opening a web site at which one can get a benchmark input data set to solve the set covering problem
暂无分享,去创建一个
[1] S. Thomas McCormick,et al. Integer Programming and Combinatorial Optimization , 1996, Lecture Notes in Computer Science.
[2] J. F. Pierce,et al. Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems , 1973 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Egon Balas,et al. On the Set-Covering Problem , 1972, Oper. Res..
[5] G. Nemhauser,et al. Integer Programming , 2020 .
[6] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[7] Norio Okada,et al. A computational study of a genetic algorithm to solve the set covering problem , 2003 .
[8] Kurt Spielberg,et al. Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..
[9] Harvey M. Salkin,et al. Set Covering by an All Integer Algorithm: Computational Experience , 1973, JACM.
[10] Baoding Liu,et al. A genetic algorithm for chance constrained programming , 1996 .
[11] Kakuzo Iwamura. A Remark on Solving the Set-Partitioning Problem by Dual All Integer Algorithm(Mathematical Foundations of Computer Science and Their Applications) , 1985 .