Heuristic and exact algorithms for the interval min-max regret knapsack problem
Year of publication: |
2015
|
---|---|
Authors: | Furini, Fabio ; Iori, Manuel ; Martello, Silvano ; Yagiura, Mutsunori |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 2, p. 392-405
|
Subject: | robust optimization | knapsack problem | interval min-max regret | local search | Lagrangian relaxation | branch and cut | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
Branch and solve strategies-based algorithm for the quadratic multiple knapsack problem
Aïder, Méziane, (2022)
-
A branch and price algorithm for the SS/TDMA problem with cardinality constraint
Colombo, Fabio, (2013)
-
Heuristic algorithms for the general nonlinear separable knapsack problem
D'Ambrosio, Claudia, (2011)
- More ...
-
Wu, Wei, (2022)
-
Rejoinder on: Routing problems with loading constraints
Iori, Manuel, (2010)
-
Rejoinder on: Routing problems with loading constraints
Iori, Manuel, (2010)
- More ...