A dynamic programming heuristic for the quadratic knapsack problem
From MaRDI portal
Recommendations
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Dynamic programming revisited: Improving knapsack algorithms
- Linear programming for the \(0-1\) quadratic knapsack problem
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Quadratic bottleneck knapsack problems
Cites work
- An Algorithm for Large Zero-One Knapsack Problems
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Exact Solution of the Quadratic Knapsack Problem
- Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1795719 (Why is no real title available?)
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Quadratic knapsack problems
- Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
- Solution of large quadratic knapsack problems through aggressive reduction
- The quadratic 0-1 knapsack problem with series-parallel support
- The quadratic knapsack problem -- a survey
Cited in
(29)- Dual mean field search for large scale linear and quadratic knapsack problems
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Dual mean field annealing scheme for binary optimization under linear constraints
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- An approximate dynamic programming approach to convex quadratic knapsack problems
- A cut-and-branch algorithm for the quadratic knapsack problem
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Approximation of the quadratic knapsack problem
- Asymptotic behavior of the quadratic knapsack problem
- The effect of dynamic penalty function on solution of quadratic knapsack problem with simulated annealing algorithm
- New concepts of principal component analysis based on maximum separation of clusters
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Network-based approximate linear programming for discrete optimization
- Lagrangian heuristics for the quadratic knapsack problem
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Matheuristics: survey and synthesis
- Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
- Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
- The quadratic knapsack problem
- A 3-space dynamic programming heuristic for the cubic knapsack problem
- A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
- One-dimensional bin packing with pattern-dependent processing time
- A novel dynamic programming heuristic for the quadratic knapsack problem
- A nonparametric robust optimization approach for chance-constrained knapsack problem
- Efficient local and tabu search strategies for large-scale general quadratic integer programming
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
This page was built for publication: A dynamic programming heuristic for the quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967622)
