A new upper bound for the multiple knapsack problem
Paolo Detti
| 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 | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.cor.2021.105210 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012494756