Solving the winner determination problem via a weighted maximum clique heuristic
作者：
Highlights：
• The winner determination problem (WDP) is a key issue in combinatorial auctions with many applications.
• We recast the WDP to a clique problem (MWCP) and solve it with a recent clique heuristic.
• The approach is assessed on three test suites of 530 benchmark instances.
• The approach outperforms the current best specific WDP heuristics in quality and efficiency.
• The approach is an useful alternative to solve the WDP in respect to the CPLEX solver.
摘要
•The winner determination problem (WDP) is a key issue in combinatorial auctions with many applications.•We recast the WDP to a clique problem (MWCP) and solve it with a recent clique heuristic.•The approach is assessed on three test suites of 530 benchmark instances.•The approach outperforms the current best specific WDP heuristics in quality and efficiency.•The approach is an useful alternative to solve the WDP in respect to the CPLEX solver.
论文关键词：Winner determination,Combinatorial auctions,Tabu search,Maximum clique,Heuristics,Combinatorial optimization
论文评审过程：Available online 7 August 2014.
论文官网地址：https://doi.org/10.1016/j.eswa.2014.07.027
