Asymptotic behavior of the quadratic knapsack problem
From MaRDI portal
Recommendations
Cites work
- A dynamic programming heuristic for the quadratic knapsack problem
- A semidefinite programming approach to the quadratic knapsack problem
- An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Asymptotic Statistics
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Exact Solution of the Quadratic Knapsack Problem
- Fast probabilistic algorithms for Hamiltonian circuits and matchings
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- On linear programs with random costs
- Operations research and enterprise systems. Third international conference, ICORES 2014, Angers, France, March 6--8, 2014. Revised selected papers
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Quadratic knapsack problems
- Relations between average case complexity and approximation complexity
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- 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
(11)- Optimal setup of a multihead weighing machine
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
- A cut-and-branch algorithm for the quadratic knapsack problem
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- 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
- A novel dynamic programming heuristic for the quadratic knapsack problem
- The most dispersed subset of random points in \(\mathbb{R}^d\)
This page was built for publication: Asymptotic behavior of the quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q323537)
