Relaxations and heuristics for the multiple non-linear separable knapsack problem
| Year of publication: |
May 2018
|
|---|---|
| Authors: | D'Ambrosio, Claudia ; Martello, Silvano ; Mencarelli, Luca |
| Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 93.2018, p. 79-89
|
| Subject: | Multiple non-linear knapsack problem | Heuristic algorithms | Surrogate relaxation | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir, (2018)
-
A random search algorithm for cyclic delivery synchronization problem
Gdowska, Katarzyna, (2017)
-
Algorithmic approaches to the multiple knapsack assignment problem
Martello, Silvano, (2019)
- More ...
-
Complex portfolio selection via convex mixed-integer quadratic programming : a survey
Mencarelli, Luca, (2018)
-
Optimal scheduling of a multiunit hydro power station in a short-term planning horizon
Borghetti, Alberto, (2015)
-
Lower and upper bounds for the non-linear generalized assignment problem
D'Ambrosio, Claudia, (2020)
- More ...