Using a Lagrangian Heuristic for a Combinatorial Auction Problem.
Yunsong GuoAndrew LimBrian RodriguesJiqing TangPublished in: Int. J. Artif. Intell. Tools (2006)
Keyphrases
- lagrangian heuristic
- combinatorial auctions
- branch and bound
- multi unit
- winner determination
- resource allocation
- mechanism design
- approximation algorithms
- single item
- set covering
- network design problem
- auction protocol
- mixed integer
- search space
- special case
- lagrangian relaxation
- auction mechanisms
- column generation
- optimal solution
- bidding strategies
- upper bound