An All-Around Near-Optimal Solution for the Classic Bin Packing Problem.
Shahin KamaliAlejandro López-OrtizPublished in: CoRR (2014)
Keyphrases
- optimal solution
- lower bound
- knapsack problem
- np hard
- branch and bound
- feasible solution
- bin packing
- linear programming
- global optimum
- objective function
- linear program
- search space
- branch and bound algorithm
- iterative procedure
- packing problem
- column generation
- upper bound
- exact solution
- metaheuristic
- decision trees
- greedy heuristic
- database
- multiple knapsack
- mathematical programming
- search algorithm
- video sequences
- information retrieval
- real time