Using a Lagrangian Heuristic for a Combinatorial Auction Problem.
Yunsong GuoAndrew LimBrian RodriguesJiqing TangPublished in: ICTAI (2005)
Keyphrases
- lagrangian heuristic
- combinatorial auctions
- branch and bound
- multi unit
- winner determination
- resource allocation
- approximation algorithms
- mechanism design
- single item
- mathematical programming
- mixed integer
- special case
- network design problem
- lagrangian relaxation
- combinatorial optimization
- search algorithm
- set covering
- auction protocol
- lower bound
- greedy heuristic