Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search.
Robert C. HoltePublished in: Canadian Conference on AI (2001)
Keyphrases
- knapsack problem
- hill climbing search
- combinatorial auctions
- winner determination
- optimal solution
- resource allocation
- beam search
- search space
- np hard
- approximation algorithms
- mechanism design
- optimization problems
- single item
- dynamic programming
- multi unit
- bayesian network structure learning
- test problems
- multi unit combinatorial auctions
- linear programming relaxation
- production planning
- bayesian networks
- special case
- greedy algorithm
- mathematical programming
- hill climbing
- vehicle routing problem
- computational complexity
- bidding strategies
- scheduling problem
- linear programming
- neural network
- worst case