Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
Year of publication: |
2020
|
---|---|
Authors: | Guignard-Spielberg, Monique |
Published in: |
Operations research and systems : XVIII Latin-Iberian-American conference on operations research, Claio 2016. - New York, NY, USA : Springer. - 2020, p. 173-200
|
Subject: | Generalized Quadratic Assignment Problem | Crossdock Door Assignment Problem | Quadratic knapsack problem | RLT bounds | Lagrangean relaxation | Integer Linearization Property | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Furini, Fabio, (2019)
-
Asymptotic behavior of the quadratic knapsack problem
Schauer, Joachim, (2016)
-
Parametric convex quadratic relaxation of the quadratic knapsack problem
Fampa, Marcia Helena Costa, (2020)
- More ...
-
A Lagrangean dual ascent algorithm for simple plant location problems
Guignard-Spielberg, Monique, (1988)
-
Optimizing the pipeline planning system at the national oil company
Quinteros, Martin, (2019)
-
On dealing with strategic and tactical decision levels in forestry planning under uncertainty
Alonso-Ayuso, Antonio, (2020)
- More ...