A new upper bound for the 0-1 quadratic knapsack problem
From MaRDI portal
(Redirected from Publication:1806683)
Recommendations
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
- Decomposition and linearization for 0-1 quadratic programming
Cites work
- scientific article; zbMATH DE number 4112385 (Why is no real title available?)
- A Decomposition Method for Quadratic Zero-One Programming
- A Fast Parametric Maximum Flow Algorithm and Applications
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- A semidefinite programming approach to the quadratic knapsack problem
- Clustering and domination in perfect graphs
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Linear programming for the \(0-1\) quadratic knapsack problem
- Min-cut clustering
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- Quadratic knapsack problems
- Validation of subgradient optimization
Cited in
(26)- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- scientific article; zbMATH DE number 729909 (Why is no real title available?)
- Decomposition and linearization for 0-1 quadratic programming
- The generalized quadratic knapsack problem. A neuronal network approach
- Lagrangian heuristics for the quadratic knapsack problem
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- 0-1 quadratic knapsack problems: an exact approach based on a \(t\)-linearization
- Lagrangean methods for 0-1 quadratic problems
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- The quadratic knapsack problem -- a survey
- A column generation approach for the unconstrained binary quadratic programming problem
- On reduction of duality gap in quadratic knapsack problems
- Upper bounds for large scale integer quadratic multidimensional knapsack problems
- The polynomial robust knapsack problem
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- Global optimality conditions and optimization methods for quadratic knapsack problems
- Lagrangean decompositions for the unconstrained binary quadratic programming problem
- The quadratic 0-1 knapsack problem with series-parallel support
This page was built for publication: A new upper bound for the 0-1 quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806683)
