Tighter representations for set partitioning problems

Adams, 1986, A tight linearization and an algorithm for zero-one quadratic programs, Management Sci., 32, 1274, 10.1287/mnsc.32.10.1274 Adams, 1993, Mixed-integer bilinear programming problems, Math. Programming, 59, 279, 10.1007/BF01581249 Balas, 1977, Some valid inequalities for the set partitioning problem, Ann. Discrete Math., 1, 13, 10.1016/S0167-5060(08)70725-8 Balas, 1993, A lift-and-project cutting plane procedure for mixed 0 1 programming, Math. Progamming, 58, 295, 10.1007/BF01581273 Balas, 1975, On the set covering problem: II, 23, 74 Balas, 1976, Set partitioning: a survey, SIAM Rev., 18, 710, 10.1137/1018115 Ceria, 1993, Lift-and-project methods for mixed 0–1 programs Chan, 1992, A multiplier adjustment approach for the set partitioning problem. Oper Res., 40, S40 Fisher, 1990, Optimal solution of set covering/partitioning problems using dual heuristics. Management Sci., 36, 674 Garfinkel, 1969, The set partitioning problem: set covering with equality constraints, Oper. Res., 17, 848, 10.1287/opre.17.5.848 Hoffman, 1992, Solving large set-partitioning problems with side constraints Marsten, 1974, An algorithm for large set partitioning problems, Management Sci., 20, 774, 10.1287/mnsc.20.5.774 Nemhauser, 1979, Optimal set partitioning matchings and Lagrangian duality, Naval Res. Logis. Quart., 26, 553, 10.1002/nav.3800260401 Nemhauser, 1988 Sherali, 1990, A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems, SIAM J. Discrete Math., 3, 411, 10.1137/0403036 Sherali, 1994, A hierarchy of relaxations and convex hull characterizations for mixed integer zero-one programming problems, Discrete Appl. Math., 52, 83, 10.1016/0166-218X(92)00190-W