Mathematical models and decomposition methods for the multiple knapsack problem
| Year of publication: |
2019
|
|---|---|
| Authors: | Dell'Amico, Mauro ; Delorme, Maxence ; Iori, Manuel ; Martello, Silvano |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 274.2019, 3 (1.5.), p. 886-899
|
| Subject: | Combinatorial optimization | Multiple knapsack problem | Exact algorithms | Pseudo-polynomial formulations | Decomposition methods | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Dekompositionsverfahren | Decomposition method | Algorithmus | Algorithm |
-
A cutting plane algorithm for the site layout planning problem with travel barriers
Hammad, Ahmed W. A., (2017)
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
-
An algorithmic framework for the exact solution of tree-star problems
Leitner, Markus, (2017)
- More ...
-
Heuristic and exact algorithms for the identical parallel machine scheduling problem
Dell'Amico, Mauro, (2008)
-
A note on exact and heuristic algorithms for the identical parallel machine scheduling problem
Dell'Amico, Mauro, (2012)
-
Kramer, Raphael, (2017)
- More ...