Pages that link to "Item:Q1583699"

The following pages link to A semidefinite programming approach to the quadratic knapsack problem (Q1583699):

Displaying 50 items.

• A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
• Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
• Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
• Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (Q490355) (← links)
• A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
• Knapsack problem with probability constraints (Q628737) (← links)
• Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
• On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• The submodular knapsack polytope (Q1040079) (← links)
• An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040) (← links)
• Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
• A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← links)
• An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
• Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
• Product assortment and space allocation strategies to attract loyal and non-loyal customers (Q2184066) (← links)
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications (Q2190318) (← links)
• On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem (Q2216176) (← links)
• \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
• Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
• Quadratic bottleneck knapsack problems (Q2359152) (← links)
• A new family of facet defining inequalities for the maximum edge-weighted clique problem (Q2361127) (← links)
• A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
• An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• Unbounded convex sets for non-convex mixed-integer quadratic programming (Q2436643) (← links)
• Upper bounds and exact algorithms for \(p\)-dispersion problems (Q2496032) (← links)
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
• An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930) (← links)
• Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
• Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
• A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
• On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
• A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks (Q2840686) (← links)
• (Q2861559) (← links)
• A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
• A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access (Q2892140) (← links)
• A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations (Q3188440) (← links)
• A Decomposition Algorithm for the Sums of the Largest Eigenvalues (Q4985169) (← links)
• Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
• Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
• Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
• Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)