返回
A fast approximation algorithm for solving the complete set packing problem
DOI:10.1016/j.ejor.2014.01.024.png)
摘要
En 中文
We study the complete set packing problem (CSPP) where the family of feasible subsets may include all possible combinations of objects. This setting arises in applications such as combinatorial auctions (for selecting optimal bids) and cooperative game theory (for finding optimal coalition structures). Although the set packing problem has been well-studied in the literature, where exact and approximation algorithms can solve very large instances with up to hundreds of objects and thousands of feasible subsets, these methods are not extendable to the CSPP since the number of feasible subsets is exponentially large. Formulating the CSPP as an MILP and solving it directly, using CPLEX for example, is impossible for problems with more than 20 objects. We propose a new mathematical formulation for the CSPP that directly leads to an efficient algorithm for finding feasible set packings (upper bounds). We also propose a new formulation for finding tighter lower bounds compared to LP relaxation and develop an efficient method for solving the corresponding large-scale MILP. We test the algorithm with the winner determination problem in spectrum auctions, the coalition structure generation problem in coalitional skill games, and a number of other simulated problems that appear in the literature. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Set packing problem
Combinatorial auctions
Winner determination problem
Coalition structure generation
Large-scale MILP
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Comparison of the safety and immunogenicity of concomitant and sequential administration of an adult formulation tetanus and diphtheria toxoids adsorbed combined with acellular pertussis (Tdap) vaccine and trivalent inactivated influenza vaccine in adults
Vaccine
IF0

