A branch-and-bound algorithm for the knapsack problem with conflict graph
Andrea Bettinelli, Valentina Cacchiani, Enrico Malaguti
| Year of publication: |
2017
|
|---|---|
| Authors: | Bettinelli, Andrea ; Cacchiani, Valentina ; Malaguti, Enrico |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 29.2017, 3, p. 457-473
|
| Subject: | knapsack problem | maximum weight stable set problem | branch and bound | combinatorial optimization | computational experiments | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Graphentheorie | Graph theory | Operations Research | Operations research | 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.1287/ijoc.2016.0742 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011743447