A semidefinite programming approach to the quadratic knapsack problem
From MaRDI portal
Publication:1583699
DOI10.1023/A:1009898604624zbMATH Open0970.90075OpenAlexW2087999447MaRDI QIDQ1583699FDOQ1583699
Authors: Christoph Helmberg, Franz Rendl, Robert Weismantel 
Publication date: 30 October 2000
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009898604624
Recommendations
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- Combining semidefinite and polyhedral relaxations for integer programs
- scientific article; zbMATH DE number 1182577
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- Exact solution methods for the \(k\)-item quadratic knapsack problem
cutting planessemidefinite relaxationsquadratic knapsack problemconstrained quadratic \(0/1\) programming
Cited In (67)
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
- Title not available (Why is that?)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- A two stage stochastic semidefinite relaxation for wireless OFDMA networks
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- A decomposition algorithm for the sums of the largest eigenvalues
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- An exact semidefinite programming approach for the max-mean dispersion problem
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
- Partial Lagrangian relaxation for general quadratic programming
- On reduction of duality gap in quadratic knapsack problems
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Semi-definite relaxation algorithm of multiple knapsack problem
- A note on optimal solutions to quadratic knapsack problems
- Unbounded convex sets for non-convex mixed-integer quadratic programming
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- An iterated ``hyperplane exploration approach for the quadratic knapsack problem
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Semidefinite and conic programming for robust wireless OFDMA networks
- Two-stage quadratic integer programs with stochastic right-hand sides
- On linear conic relaxation of discrete quadratic programs
- Rank two relaxation to the quadratic knapsack problem
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
- Lagrangian heuristics for the quadratic knapsack problem
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- Quadratic bottleneck knapsack problems
- The space decomposition theory for a class of eigenvalue optimizations
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- A fast space-decomposition scheme for nonconvex eigenvalue optimization
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Asymptotic behavior of the quadratic knapsack problem
- Knapsack problem with probability constraints
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
- Generating cutting planes for the semidefinite relaxation of quadratic programs
- A cut-and-branch algorithm for the quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- The quadratic knapsack problem -- a survey
- Combining semidefinite and polyhedral relaxations for integer programs
- A new family of facet defining inequalities for the maximum edge-weighted clique problem
- The submodular knapsack polytope
- A second-order bundle method based on \(\mathcal{UV}\)-decomposition strategy for a special class of eigenvalue optimizations
- Using two-dimensional projections for stronger separation and propagation of bilinear terms
- Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
- Quadratic Combinatorial Optimization Using Separable Underestimators
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- Supermodular covering knapsack polytope
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- Inductive linearization for binary quadratic programs with linear constraints
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- A space decomposition scheme for maximum eigenvalue functions and its applications
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Product assortment and space allocation strategies to attract loyal and non-loyal customers
Uses Software
This page was built for publication: A semidefinite programming approach to the quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583699)
