Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics.
Rica GonenDaniel LehmannPublished in: EC (2000)
Keyphrases
- branch and bound
- multi unit combinatorial auctions
- optimal solution
- branch and bound procedure
- search algorithm
- mini bucket
- beam search
- branch and bound algorithm
- tree search
- lower bound
- heuristic solution
- column generation
- search space
- branch and bound search
- tree search algorithm
- search strategies
- upper bound
- partial solutions
- combinatorial optimization
- heuristic search
- network design problem
- combinatorial auctions
- metaheuristic
- branch and bound method
- bnb adopt
- randomly generated problems
- search heuristics
- integer programming problems
- objective function
- greedy heuristic
- knapsack problem
- max sat
- feasible solution
- lagrangian heuristic
- np hard
- search methods