Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Year of publication: |
2019
|
---|---|
Authors: | Gurski, Frank ; Rehs, Carolin |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 89.2019, 3, p. 411-432
|
Subject: | Knapsack problem | Forcing graph | Conflict graph | Clique-width | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Konflikt | Conflict | Mathematische Optimierung | Mathematical programming |
-
Ben Salem, Mariem, (2017)
-
Some new clique inequalities in four-index hub location models
Landete, Mercedes, (2024)
-
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Zhou, Qing, (2025)
- More ...
-
Solutions for subset sum problems with special digraph constraints
Gurski, Frank, (2020)
-
Counting and enumerating independent sets with applications to combinatorial optimization problems
Gurski, Frank, (2020)
-
Solutions for subset sum problems with special digraph constraints
Gurski, Frank, (2020)
- More ...