Using a Lagrangian Heuristic for a Combinatorial Auction Problem
Combinatorial auctions allow bidders to bid for items leading to more efficient allocations, but determining winners in auctions is $\mathcal{NP}$-complete. In this work, a simple yet effective Lagrangian relaxation based heuristic algorithm is presented. Extensive computational experiments using st...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2006
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/558 https://doi.org/10.1142/S0218213006002771 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|