Tighter Representations for Set Partitioning Problems

  title={Tighter Representations for Set Partitioning Problems},
  author={Hanif D. Sherali and Youngho Lee},
  journal={Discrete Applied Mathematics},
In this paper, we consider the set partitioning polytope and we begin by applying the reformulation-linearization technique of Sherali and Adams (1990, 1994) to generate a specialized hierarchy of relaxations by exploiting the structure of this polytope. We then show that several known classes of valid inequalities for this polytopc, as well as related tightening and composition rules, are automatically captured within the firstand second-level relaxations of this hierarchy. Hence, these… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 16 references

Some valid inequalities for the set partitioning problem

  • E. Balas
  • Ann. Discrete Math
  • 1977
Highly Influential
3 Excerpts

A lift-and-project cutting plane procedure for mixed 0 I

  • E. Balas. S. Cercia, G. Cornuejols
  • programming, Math. Progamming
  • 1993

Lift-and-project methods for mixed 0-l programs

  • S. Ceria
  • Graduate School of Industrial Administration…
  • 1993

Solving large set-partitioning problems with side constraints

  • K. L. Hoffman, M. Padberg
  • ORSA/TIMS Joint National Meeting, San Francisco,
  • 1992

Optimal solution of set covering/partitioning problems using dual heuristics

  • M. L. Fisher, P. Kedia
  • Management Sci
  • 1990

Similar Papers

Loading similar papers…