论文信息 - A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering

A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering

Abstract : We discuss a branch and bound algorithm for set covering, whose centerpiece is an integrated upper bounding/lower bounding procedure called dynamic subgradient optimization (DYNSGRAD), that is applied to a Lagrangian dual problem at every node of the search tree. Extensive experimentation has shown DYNSGRAD to represent a significant improvement over currently used techniques.

Egon Balas | Maria C. Carrera | E. Balas | M. C. Carrera

[1] Dorit S. Hochbaum,et al. A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..

[2] G. L. Thompson,et al. THE COLUMN SUBSTRACTION ALGORITHM: AN EXACT METHOD FOR SOLVING THE WEIGHTED SET COVERING PROBLEM , 1989 .

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

[4] Antonio Sassano,et al. A Separation Routine for the Set Covering Polytope , 1992, IPCO.

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

[6] Jack J. Dongarra,et al. Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[7] Javier Etcheberry,et al. The Set-Covering Problem: A New Implicit Enumeration Algorithm , 1977, Oper. Res..

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

[9] J. Beasley,et al. Enhancing an algorithm for set covering problems , 1992 .

[10] J. Beasley. A lagrangian heuristic for set‐covering problems , 1990 .

[11] M. Fisher,et al. Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .