A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Stefano Coniglio, Fabio Furini, Pablo San Segundo
| Year of publication: |
2021
|
|---|---|
| Authors: | Coniglio, Stefano ; Furini, Fabio ; San Segundo, Pablo |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 2 (1.3.), p. 435-455
|
| Subject: | Combinatorial optimization | Knapsack Problem with Conflicts | Maximum Weighted Clique Problem | Branch-and-bound algorithm | Theorie | Theory | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2020.07.023 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012416751