Pages that link to "Item:Q3186661"
From MaRDI portal
The following pages link to Approximation of the Quadratic Knapsack Problem (Q3186661):
Displaying 10 items.
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Approximation of the quadratic knapsack problem (Q1694783) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- On the rectangular knapsack problem (Q2168057) (← links)
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
- Packing Under Convex Quadratic Constraints (Q5041751) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
