Pages that link to "Item:Q2178343"
From MaRDI portal
The following pages link to Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343):
Displaying 4 items.
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs (Q1935886) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Lagrangean decomposition: A model yielding stronger lagrangean bounds (Q3780005) (← links)