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 | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir, (2018)
-
The assignment and loading transportation problem
Homsi, Gabriel, (2021)
-
Al Athamneh, Raed, (2023)
- More ...
-
Complex portfolio selection via convex mixed-integer quadratic programming : a survey
Mencarelli, Luca, (2018)
-
Heuristic algorithms for the general nonlinear separable knapsack problem
D'Ambrosio, Claudia, (2011)
-
Optimistic MILP modeling of non-linear optimization problems
Rovatti, Riccardo, (2014)
- More ...