The quadratic 0-1 knapsack problem with series-parallel support
From MaRDI portal
Recommendations
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- 0-1 quadratic knapsack problems: an exact approach based on a t-linearization
- The quadratic knapsack problem -- a survey
- Linear programming for the \(0-1\) quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- Quadratic bottleneck knapsack problems
- A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A 0-1 quadratic knapsack problem for modelizing and solving the constraint satisfaction problems
- An O(n) algorithm for quadratic knapsack problems
Cites work
- A new upper bound for the 0-1 quadratic knapsack problem
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- Fast Approximation Algorithms for Knapsack Problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Linear-time computability of combinatorial problems on series-parallel graphs
- Min-cut clustering
- On the supermodular knapsack problem
- Quadratic knapsack problems
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- The Recognition of Series Parallel Digraphs
- Topology of series-parallel networks
Cited in
(31)- Adjacency of the 0-1 knapsack problem
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Approximation of the quadratic knapsack problem
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- LAD models, trees, and an analog of the fundamental theorem of arithmetic
- A PTAS for a class of binary non-linear programs with low-rank functions
- Packing under convex quadratic constraints
- On the rectangular knapsack problem
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- Approximation schemes for \(r\)-weighted minimization knapsack problems
- Quadratic bottleneck knapsack problems
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- The densest \(k\)-subgraph problem on clique graphs
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Exact solution methods for the k-item quadratic knapsack problem
- A dynamic programming heuristic for the quadratic knapsack problem
- Online maximum \(k\)-coverage
- Approximation of the quadratic knapsack problem
- Approximating the quadratic knapsack problem on special graph classes
- Asymptotic behavior of the quadratic knapsack problem
- Online maximum \(k\)-coverage
- Packing under convex quadratic constraints
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Global optimality conditions and optimization methods for quadratic knapsack problems
- The quadratic knapsack problem
- A novel dynamic programming heuristic for the quadratic knapsack problem
- Approximability issues for unconstrained and constrained maximization of half-product related functions
- The quadratic knapsack problem -- a survey
- A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
This page was built for publication: The quadratic 0-1 knapsack problem with series-parallel support
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866980)