A new upper bound for the multiple knapsack problem
Year of publication: |
2021
|
---|---|
Authors: | Detti, Paolo |
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. 129.2021, p. 1-11
|
Subject: | Divisible sizes | Multiple Knapsack Problem | Sequential relaxation | Upper bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Mathematical models and decomposition methods for the multiple knapsack problem
Dell'Amico, Mauro, (2019)
-
Tönissen, D. D., (2017)
- More ...
-
A bi-objective coordination setup problem in a two-stage production system
Ciavotta, Michele, (2008)
-
On Dual Based Lower Bounds for the Sequential Ordering Problem with Precedences and Due Dates
Alonso-Ayuso, Antonio, (2003)
-
Local search algorithms for finding the Hamiltonian completion number of line graphs
Detti, Paolo, (2007)
- More ...