A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
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 | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Operations Research | Operations research |
-
An exact algorithm for the block relocation problem with a stowage plan
Tanaka, Shunji, (2019)
-
CliSAT : a new exact algorithm for hard maximum clique problems
San Segundo, Pablo, (2023)
-
A new branch-and-bound algorithm for the Maximum Weighted Clique Problem
Segundo, Pablo San, (2019)
- More ...
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
On the exact separation of cover inequalities of maximum depth
Catanzaro, Daniele, (2021)
-
A lexicographic pricer for the fractional bin packing problem
Coniglio, Stefano, (2019)
- More ...