A semidefinite programming approach to the quadratic knapsack problem
From MaRDI portal
Publication:1583699
DOI10.1023/A:1009898604624zbMath0970.90075OpenAlexW2087999447MaRDI QIDQ1583699
Christoph Helmberg, Robert Weismantel, Franz Rendl
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
cutting planessemidefinite relaxationsquadratic knapsack problemconstrained quadratic \(0/1\) programming
Related Items
Quadratic bottleneck knapsack problems, A new family of facet defining inequalities for the maximum edge-weighted clique problem, A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access, A computational study for bilevel quadratic programs using semidefinite relaxations, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Asymptotic behavior of the quadratic knapsack problem, A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations, Generating cutting planes for the semidefinite relaxation of quadratic programs, Partial Lagrangian relaxation for general quadratic programming, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, The quadratic knapsack problem -- a survey, A space decomposition scheme for maximum eigenvalue functions and its applications, An exact semidefinite programming approach for the max-mean dispersion problem, Product assortment and space allocation strategies to attract loyal and non-loyal customers, A cut-and-branch algorithm for the quadratic knapsack problem, SDP-based branch-and-bound for non-convex quadratic integer optimization, A lifted-space dynamic programming algorithm for the quadratic knapsack problem, Inductive linearization for binary quadratic programs with linear constraints, The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications, Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms, Knapsack problem with probability constraints, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme, Two-stage quadratic integer programs with stochastic right-hand sides, Unbounded convex sets for non-convex mixed-integer quadratic programming, The space decomposition theory for a class of eigenvalue optimizations, On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem, Quadratic Combinatorial Optimization Using Separable Underestimators, A note on representations of linear inequalities in non-convex mixed-integer quadratic programs, Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks, \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications, Supermodular covering knapsack polytope, An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations, A fast space-decomposition scheme for nonconvex eigenvalue optimization, On reduction of duality gap in quadratic knapsack problems, Simple solution methods for separable mixed linear and quadratic knapsack problem, Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem, Unnamed Item, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, Upper bounds and exact algorithms for \(p\)-dispersion problems, Lagrangian heuristics for the quadratic knapsack problem, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Efficient semidefinite branch-and-cut for MAP-MRF inference, A new upper bound for the 0-1 quadratic knapsack problem, Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1, On linear conic relaxation of discrete quadratic programs, A Decomposition Algorithm for the Sums of the Largest Eigenvalues, A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks, The submodular knapsack polytope, Parametric convex quadratic relaxation of the quadratic knapsack problem, An approximate dynamic programming approach to convex quadratic knapsack problems, A note on semidefinite relaxation for 0-1 quadratic knapsack problems
Uses Software
