A network relaxation based enumeration algorithm for set partitioning

[1]  George L. Nemhauser,et al.  The Set-Partitioning Problem: Set Covering with Equality Constraints , 1969, Oper. Res..

[2]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[3]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[4]  R. E. Marsten.  An Algorithm for Large Set Partitioning Problems , 1974 .

[5]  Egon Balas,et al.  On the Set-Covering Problem: II. An Algorithm for Set Partitioning , 1972, Oper. Res..

[6]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[7]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

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

[9]  George L. Nemhauser,et al.  Optimal set partitioning, matchings and lagrangian duality , 1979 .

[10]  Gerald G. Brown,et al.  Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models , 1980 .

[11]  R. E. Marsten,et al.  A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .

[12]  Davis Avis.  A note on some computationally difficult set covering problems , 1980, Math. Program..

[13]  John J. Bartholdi,et al.  A good submatrix is hard to find , 1982, Oper. Res. Lett..

[14]  Gerald G. Brown,et al.  Automatic identification of embedded network rows in large-scale optimization models , 1984, Math. Program..

[15]  Gerald G. Brown,et al.  Extracting embedded generalized networks from linear programming problems , 1985, Math. Program..