An Algorithm for the Penalized Multiple Choice Knapsack Problem
暂无分享,去创建一个
We present an algorithm for the penalized multiple choice knapsack problem (PMCKP), a combination of the more common penalized knapsack problem (PKP) and multiple choice knapsack problem (MCKP). Our approach is to converts a PMCKP into a PKP using a previously known transformation between MCKP and KP, and then solve the PKP greedily. For PMCKPs with well-behaved penalty functions, our algorithm is optimal for the linear relaxation of the problem.
[1] Deeparnab Chakrabarty,et al. Knapsack Problems , 2008 .
[2] Eitan Zemel,et al. The Linear Multiple Choice Knapsack Problem , 1980, Oper. Res..
[3] Michael P. Wellman,et al. Designing an Ad Auctions Game for the Trading Agent Competition , 2009, AMEC/TADA.
[4] Peter Stone,et al. TacTex09: a champion bidding agent for ad auctions , 2010, AAMAS.
[5] Albert P. M. Wagelmans,et al. A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem , 1999, Oper. Res..