An asymptotic approximation scheme for the concave cost bin packing problem.
Joseph Y.-T. LeungChung-Lun LiPublished in: Eur. J. Oper. Res. (2008)
Keyphrases
- polynomial time approximation
- bin packing
- approximation schemes
- polynomial approximation
- error bounds
- approximation algorithms
- marginal likelihood
- data sets
- objective function
- lower bound
- piecewise linear
- neural network
- randomized approximation
- central limit theorem
- error tolerance
- high cost
- approximation methods
- convex functions
- storage cost
- expected cost
- total cost
- metaheuristic
- wireless networks
- pruning power
- model selection
- special case