Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem

Mercedes Landete (), Juan Monge () and Antonio Rodríguez-Chía ()

Annals of Operations Research, 2013, vol. 207, issue 1, 137-160

Abstract: 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. Copyright Springer Science+Business Media, LLC 2013

Keywords: Set packing; Valid inequality; Boolean quadric polytope (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-011-1039-4 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:207:y:2013:i:1:p:137-160:10.1007/s10479-011-1039-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-011-1039-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().