Formulations and algorithms for the recoverable Γ-robust knapsack problem
One of the most frequently occurring substructures in integer linear programs (ILPs) is the knapsack constraint. In this paper, we study ways to deal with uncertainty in the coefficients of such constraints. We combine the budget uncertainty set of Bertsimas and Sim (Math Program Ser B 98:49–71, 200...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Elsevier
2019
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/4668faafaa9740f19abf0c4b62d8a7d6 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|