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 | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
-
Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagram
Fennich, M. Eliass, (2024)
-
Ozturk, Onur, (2017)
- More ...
-
Integer programming: state of the art and recent advances
Guignard-Spielberg, Monique,
-
A Lagrangean dual ascent algorithm for simple plant location problems
Guignard-Spielberg, Monique, (1988)
-
Guignard-Spielberg, Monique, (2005)
- More ...