Lifting of probabilistic cover inequalities
Year of publication: |
September 2017
|
---|---|
Authors: | Joung, Seulgi ; Park, Sungsoo |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 45.2017, 5, p. 513-518
|
Subject: | Chance-constrained optimization | Knapsack problem | Probabilistic cover | Lifting | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Wahrscheinlichkeitsrechnung | Probability theory | Ganzzahlige Optimierung | Integer programming |
-
Cover by disjoint cliques cuts for the knapsack problem with conflicting items
Luiz, Thiago Alcântara, (2021)
-
Yoda, Kunikazu, (2016)
-
Network design with vulnerability constraints and probabilistic edge reliability
Arslan, Okan, (2023)
- More ...
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
A closest benders cut selection scheme for accelerating the benders decomposition algorithm
Seo, Kiho, (2022)
-
Kwon, Sue-Jeong, (2019)
- More ...