Pages that link to "Item:Q2399291"
From MaRDI portal
The following pages link to Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291):
Displaying 5 items.
- Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- Packing Under Convex Quadratic Constraints (Q5041751) (← links)