Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Year of publication: |
2021
|
---|---|
Authors: | Luiz, Thiago Alcântara ; Santos, Haroldo Gambini ; Uchoa, Eduardo |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 6, p. 844-850
|
Subject: | Clique inequality | Combinatorial cuts | Cover inequality | Knapsack problem | Lifting | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Einkommensverteilung | Income distribution | Branch-and-Bound | Branch and Bound |
-
Lifting of probabilistic cover inequalities
Joung, Seulgi, (2017)
-
Network Loading Problem : valid inequalities from 5- and higher partitions
Agarwal, Y. K., (2018)
-
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio, (2015)
- More ...
-
Strong bounds with cut and column generation for class-teacher timetabling
Santos, Haroldo Gambini, (2012)
-
Strong bounds with cut and column generation for class-teacher timetabling
Santos, Haroldo Gambini, (2012)
-
Limited memory rank-1 cuts for vehicle routing problems
Pecin, Diego, (2017)
- More ...