Alternative formulations for the set packing problem and their application to the winner determination problem

DOI10.1007/s10479-011-1039-4zbMath1297.90138OpenAlexW2071891968MaRDI QIDQ367639

Mercedes Landete, Antonio M. Rodríguez-Chía, Juan Francisco Monge

Publication date: 16 September 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1039-4

zbMATH Keywords

set packingvalid inequalityBoolean quadric polytope

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Solving the set packing problem via a maximum weighted independent set heuristic

Uses Software

• CABOB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Facets and lifting procedures for the set covering polytope
• On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
• A new approach for modeling and solving set packing problems
• Combinatorial auctions
• Data dependent worst case bounds for weighted set packing
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Computationally Manageable Combinational Auctions
• Combinatorial Auctions: A Survey
• Combinatorial Auction Design
• CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
• Facet Obtaining Procedures for Set Packing Problems
• Properties of vertex packing and independence system polyhedra
• Auction Algorithms for Market Equilibrium
• Facets of the Complementarity Knapsack Polytope
• New facets for the set packing polytope

This page was built for publication: Alternative formulations for the set packing problem and their application to the winner determination problem