The quadratic knapsack problem
From MaRDI portal
approximationcomputational resultsexact solutionheuristicslinearizationmetaheuristicsquadratic knapsack problemupper bounds
History of mathematics in the 20th century (01A60) History of mathematics in the 21st century (01A61) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) History of operations research and mathematical programming (90-03) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Cites work
- 0-1 quadratic knapsack problems: an exact approach based on a t-linearization
- `` Strong NP-Completeness Results
- A conic approximation method for the 0-1 quadratic knapsack problem
- A cut-and-branch algorithm for the quadratic knapsack problem
- A dynamic programming heuristic for the quadratic knapsack problem
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A hub location problem with fully interconnected backbone and access networks
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- A novel dynamic programming heuristic for the quadratic knapsack problem
- A Selection Problem of Shared Fixed Costs and Network Flows
- A semidefinite programming approach to the quadratic knapsack problem
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- 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
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Approximation of the quadratic knapsack problem
- Approximation of the quadratic knapsack problem
- Approximations of pseudo-Boolean functions; applications to game theory
- Asymptotic behavior of the quadratic knapsack problem
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Constraint Pairing In Integer Programming
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems
- Global optimality conditions and optimization methods for quadratic knapsack problems
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 1488074 (Why is no real title available?)
- scientific article; zbMATH DE number 1795719 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Lagrangian heuristics for the quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- L’algebre de Boole et ses applications en recherche operationnelle
- Min-cut clustering
- On reduction of duality gap in quadratic knapsack problems
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic knapsack problems
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
- 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
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The generalized quadratic knapsack problem. A neuronal network approach
- The nonlinear knapsack problem - algorithms and applications
- The performance of the modified subgradient algorithm on solving the 0-1 quadratic Knapsack problem
- The quadratic 0-1 knapsack problem with series-parallel support
- The quadratic knapsack problem -- a survey
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- TSPLIB—A Traveling Salesman Problem Library
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
- Variable neighborhood search for large offshore wind farm layout optimization
Cited in
(2)
This page was built for publication: The quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931768)
