论文信息 - Probabilistic partial set covering problems - 字舞流文

Probabilistic partial set covering problems

Hanif D. Sherali | Seong-in Kim | H. Sherali | Seong-in Kim | Edna L. Parrish | E. L. Parrish

[1] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

[2] Hanif D. Sherali,et al. The design of branch and bound algorithms for a class of nonlinear integer programs , 1986 .

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

[4] J. Beasley. An algorithm for set covering problem , 1987 .

[5] R. E. Marsten,et al. An Algorithm for Nonlinear Knapsack Problems , 1976 .

[6] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7] Umit Akinc. An Algorithm for the Knapsack Problem , 1983 .

[8] R. J. Dakin,et al. A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..