Optimal Solutions for Multi-Unit Combinatorial Auctions: Branch and Bound Heuristics
Rica GonenDaniel LehmannPublished in: CoRR (2002)
Keyphrases
- branch and bound
- multi unit combinatorial auctions
- optimal solution
- branch and bound procedure
- search algorithm
- mini bucket
- beam search
- tree search
- branch and bound algorithm
- lower bound
- branch and bound search
- heuristic solution
- search space
- column generation
- search strategies
- tree search algorithm
- bnb adopt
- combinatorial auctions
- network design problem
- combinatorial optimization
- randomly generated problems
- upper bound
- partial solutions
- heuristic search
- objective function
- metaheuristic
- linear programming
- knapsack problem
- branch and bound method
- np hard
- linear programming relaxation
- greedy heuristic
- max sat
- lagrangian heuristic
- special case
- iterative deepening
- feasible solution