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 |
-
Naderi, Bahman, (2020)
-
An algorithmic framework for the exact solution of tree-star problems
Leitner, Markus, (2017)
-
Stable set reformulations for the degree preserving spanning tree problem
Lucena, AbĂlio, (2024)
- More ...
-
Bin packing and cutting stock problems : mathematical models and exact algorithms
Delorme, Maxence, (2016)
-
Logic based Benders' decomposition for orthogonal stock cutting problems
Delorme, Maxence, (2017)
-
Heuristic and exact algorithms for the identical parallel machine scheduling problem
Dell'Amico, Mauro, (2008)
- More ...