Pages that link to "Item:Q4645922"
From MaRDI portal
The following pages link to Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922):
Displayed 10 items.
- Discrete location problems with push-pull objectives (Q697575) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- The quadratic 0-1 knapsack problem with series-parallel support (Q1866980) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
- Combining semidefinite and polyhedral relaxations for integer programs (Q5101410) (← links)
- A Lagrangian relaxation approach to the edge-weighted clique problem (Q5937353) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)