A new upper bound for the 0-1 quadratic knapsack problem
From MaRDI portal
Publication:1806683
DOI10.1016/S0377-2217(97)00414-1zbMath0933.90049OpenAlexW2057884923MaRDI QIDQ1806683
Alain Billionnet, Alain Faye, Eric Soutif
Publication date: 8 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00414-1
quadratic programmingupper boundcomputational experimentsLagrangian decomposition0-1 quadratic knapsack problemquadratic pseudo-Boolean function
Related Items (21)
On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ The quadratic knapsack problem -- a survey ⋮ A column generation approach for the unconstrained binary quadratic programming problem ⋮ On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem ⋮ Global optimality conditions and optimization methods for quadratic knapsack problems ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ On reduction of duality gap in quadratic knapsack problems ⋮ Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem ⋮ An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ The generalized quadratic knapsack problem. A neuronal network approach ⋮ Lagrangian heuristics for the quadratic knapsack problem ⋮ Lagrangean decompositions for the unconstrained binary quadratic programming problem ⋮ Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ The polynomial robust knapsack problem ⋮ A note on semidefinite relaxation for 0-1 quadratic knapsack problems ⋮ A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems ⋮ The quadratic 0-1 knapsack problem with series-parallel support
Cites Work
- Unnamed Item
- Clustering and domination in perfect graphs
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Min-cut clustering
- A semidefinite programming approach to the quadratic knapsack problem
- A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
- Quadratic knapsack problems
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- A Fast Parametric Maximum Flow Algorithm and Applications
- Validation of subgradient optimization
- A Decomposition Method for Quadratic Zero-One Programming
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
This page was built for publication: A new upper bound for the 0-1 quadratic knapsack problem
