Reformulation of the set partitioning problem as apure network with special order set constraints

In this paper, the set partitioning problem is reformulated as a network flow problemwith special order sets. The reformulation is based on identifying network structure that ishidden in the element-set incidence matrix. The special order sets and the revealed networkin the reformulation together define an effective structure for solution by enumeration. Theresulting enumeration procedure for the solution of the set partitioning problem is computationallyadvantageous since it uses a pure network relaxation that is solved using reoptimization,allows a large number of variables to be fixed in a subproblem, and is defined overa relatively small enumeration tree. Computational experience is included.

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

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

[3]  Linus Schrage,et al.  Identification of special structure constraints in linear programs , 1981, Math. Program..

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

[5]  Rema Padman,et al.  Dual Algorithms for Pure Network Problems , 1989, Oper. Res..

[6]  Satoru Fujishige,et al.  An Efficient PQ-Graph Algorithm for Solving the Graph-Realization Problem , 1980, J. Comput. Syst. Sci..

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

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

[9]  Gautam Mitra,et al.  Graph theoretic relaxations of set covering and set partitioning problems , 1995 .

[10]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[11]  Kurt Spielberg,et al.  Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems , 1971, Oper. Res..

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

[13]  R. Fourer,et al.  Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics , 1988 .

[14]  Agha Iqbal Ali,et al.  Computational implementation of Fujishige's graph realizability algorithm , 1998, Eur. J. Oper. Res..

[15]  Candace A. Yano,et al.  A Multiplier Adjustment Approach for the Set Partitioning Problem , 1992, Oper. Res..

[16]  Richard D. McBride,et al.  Flight crew scheduling , 1993 .

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

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

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

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

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

[22]  Agha Iqbal Ali,et al.  A network relaxation based enumeration algorithm for set partitioning , 1989 .

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

[24]  Gautam Mitra,et al.  Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations , 1992 .

[25]  Hyun-Soo Han.  Algorithms to extract hidden networks and applications to set partitioning problems , 1994 .