Cargando…
Exact solution of the robust knapsack problem()
We consider an uncertain variant of the knapsack problem in which the weight of the items is not exactly known in advance, but belongs to a given interval, and an upper bound is imposed on the number of items whose weight differs from the expected one. For this problem, we provide a dynamic programm...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Pergamon Press
2013
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3727332/ https://www.ncbi.nlm.nih.gov/pubmed/24187428 http://dx.doi.org/10.1016/j.cor.2013.05.005 |