Pages that link to "Item:Q1866980"

The following pages link to The quadratic 0-1 knapsack problem with series-parallel support (Q1866980):

Displaying 27 items.

• Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
• Online maximum \(k\)-coverage (Q442204) (← links)
• Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
• Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs (Q963469) (← links)
• Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
• Approximation of the quadratic knapsack problem (Q1694783) (← links)
• A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• LAD models, trees, and an analog of the fundamental theorem of arithmetic (Q1949097) (← links)
• A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
• Packing under convex quadratic constraints (Q2118134) (← links)
• On the rectangular knapsack problem (Q2168057) (← links)
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
• Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) (← links)
• The densest \(k\)-subgraph problem on clique graphs (Q2426654) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
• Online Maximum k-Coverage (Q3088282) (← links)
• Approximation of the Quadratic Knapsack Problem (Q3186661) (← links)
• Packing Under Convex Quadratic Constraints (Q5041751) (← links)
• A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)