Pages that link to "Item:Q683935"
From MaRDI portal
The following pages link to A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935):
Displaying 4 items.
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)