An asymptotically exact algorithm for the high-multiplicity bin packing problem.
Carlo FilippiAlessandro AgnetisPublished in: Math. Program. (2005)
Keyphrases
- computational cost
- bin packing
- dynamic programming
- optimal solution
- preprocessing
- learning algorithm
- worst case
- matching algorithm
- computational complexity
- detection algorithm
- optimization algorithm
- linear programming
- simulated annealing
- np hard
- cost function
- objective function
- expectation maximization
- k means
- graph structure
- packing problem
- reinforcement learning