Tighter representations for set partitioning problems

Discrete Applied Mathematics

Volumn 68, Issue 1-2, 1996, Pages 153-167

  Sherali, Hanif D ^a   Lee, Youngho ^b  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^b US West Advanced Technologies   (United States)

Author keywords

Cutting planes; Reformulation linearization technique; Set partitioning polytope; Valid inequalities

Indexed keywords

EID: 0006222852     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00060-5     Document Type: Article

References (16)

1. W.P. Adams and H.D. Sherali, A tight linearization and an algorithm for zero-one quadratic programs, Management Sci. 32 (1986) 1274-1290.
2. W.P. Adams and H.D. Sherali, Mixed-integer bilinear programming problems, Math. Programming 59 (1993) 279-305.
3. E. Balas, Some valid inequalities for the set partitioning problem, Ann. Discrete Math. 1 (1977) 13-47.
4. E. Balas, S. Cercia and G. Cornuejols, A lift-and-project cutting plane procedure for mixed 0-1 programming, Math. Progamming 58 (1993) 295-324.
5. E. Balas and M. W. Padberg, On the set covering problem: II. An algorithm for set partitioning, Oper. Res. 23 (1975) 74-90.
6. E. Balas and M.W. Padberg, Set partitioning: a survey, SIAM Rev. 18 (1976) 710-760.
7. S. Ceria, Lift-and-project methods for mixed 0-1 programs, Ph. D. Dissertation, Graduate School of Industrial Administration, Carnegie Mellon University (1993).
8. T.J. Chan and C.A. Yano, A multiplier adjustment approach for the set partitioning problem, Oper Res. 40 (1992) S40-S47.
9. M.L. Fisher and P. Kedia, Optimal solution of set covering/partitioning problems using dual heuristics, Management Sci. 36 (1990) 674-688.
10. R.S. Garfinkel and G.L. Nemhauser, The set partitioning problem: set covering with equality constraints, Oper. Res. 17 (1969) 848-856.
11. K.L. Hoffman and M. Padberg, Solving large set-partitioning problems with side constraints, ORSA/TIMS Joint National Meeting, San Francisco, 1992 2-4 November.
12. R.E. Marsten, An algorithm for large set partitioning problems, Management Sci. 20 (1974) 774-787.
13. G.L. Nemhauser and G.M. Weber, Optimal set partitioning, matchings and Lagrangian duality, Naval Res. Logis. Quart. 26 (1979) 553-563.
14. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
15. H.D. Sherali and W.P. Adams, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math. 3 (1990) 411-430.
16. H. D. Sherali and W.P. Adams, A hierarchy of relaxations and convex hull characterizations for mixed integer zero-one programming problems, Discrete Appl. Math. 52 (1994) 83-106. (Manuscript, 1989).