Lower and upper bounds for the non-linear generalized assignment problem
Year of publication: |
2020
|
---|---|
Authors: | D'Ambrosio, Claudia ; Martello, Silvano ; Monaci, Michele |
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. 120.2020, p. 1-10
|
Subject: | Computational experiments | Heuristic algorithms | Non-linear generalized assignment problem | Upper bounds | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
Heuristic algorithms for the minmax regret flow-shop problem with interval processing times
Ćwik, Michał, (2018)
-
Finding paths with minimum shared edges
Omran, Masoud T., (2013)
-
An overview of curriculum-based course timetabling
Bettinelli, Andrea, (2015)
- More ...
-
Optimistic MILP modeling of non-linear optimization problems
Rovatti, Riccardo, (2014)
-
Heuristic algorithms for the general nonlinear separable knapsack problem
D'Ambrosio, Claudia, (2011)
-
Optimal scheduling of a multiunit hydro power station in a short-term planning horizon
Borghetti, Alberto, (2015)
- More ...