Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem
- 241 Downloads
An alternative formulation for the set packing problem in a higher dimension is presented. The addition of a new family of binary variables allows us to find new valid inequalities, some of which are shown to be facets of the polytope in the higher dimension. We also consider the Winner Determination Problem, which is equivalent to the set packing problem and whose special structure allows us to easily implement these valid inequalities in a very easy way. The computational experiments illustrate the performance of the valid inequalities and obtain good results.
KeywordsSet packing Valid inequality Boolean quadric polytope
- Anderson, A., Tenhnen, M., & Ygge, F. (2000). Integer programming for combinatorial auction winner determination. In Proceedings of fourth international conference on multiagent system (ICMAS-2000). Google Scholar
- Leyton-Brown, K., Pearson, M., & Shoham, Y. (2000). Towards a universal test suite for combinatorial auction algorithms. In Proc. ACM conf. on electronic commerce (EC-00), Minneapolis. Google Scholar
- Nemhauser, G. L., & Wolsey, L. A. (1988). Integer and combinatorial optimization. Series in discrete mathematics and optimization. New York: Wiley-Interscience. Google Scholar
- Smith, J. M. (2000). Quadratic set packing problems, Steiner trees, and their integration. International Journal of Mathematical Algorithms, 2, 47–70. Google Scholar