Heuristic algorithms for the general nonlinear separable knapsack problem
Year of publication: |
2011
|
---|---|
Authors: | D'Ambrosio, Claudia ; Martello, Silvano |
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. 38.2011, 2, p. 505-513
|
Subject: | Theorie | Theory | Heuristik | Heuristics | Algorithmus | Algorithm | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir, (2018)
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
-
An ant colony optimization approach for the multidimensional knapsack problem
Ke, Liangjun, (2010)
- More ...
-
Optimistic MILP modeling of non-linear optimization problems
Rovatti, Riccardo, (2014)
-
Optimal scheduling of a multiunit hydro power station in a short-term planning horizon
Borghetti, Alberto, (2015)
-
Relaxations and heuristics for the multiple non-linear separable knapsack problem
D'Ambrosio, Claudia, (2018)
- More ...