On the complexity of surrogate and group relaxation for integer linear programs
Year of publication: |
2021
|
---|---|
Authors: | Dokka, Trivikram ; Letchford, Adam N. ; Mansoor, M. Hasan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 4, p. 530-534
|
Subject: | Group relaxation | Integer programming | Surrogate relaxation |
-
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Cerqueus, Audrey, (2015)
-
Relaxations and heuristics for the multiple non-linear separable knapsack problem
D'Ambrosio, Claudia, (2018)
-
The Discrete Resource Allocation Problem in Flow Lines
Karabati, Selcuk, (1995)
- More ...
-
Revisiting surrogate relaxation for the multidimensional knapsack problem
Dokka, Trivikram, (2022)
-
Dokka, Trivikram, (2022)
-
Pricing and Electric Vehicle Charging Equilibria
Dokka, Trivikram, (2022)
- More ...