Pages that link to "Item:Q1905964"

The following pages link to A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964):

Displaying 32 items.

• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
• Partial Lagrangian relaxation for general quadratic programming (Q2644374) (← links)
• \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
• On Lagrangian relaxation of quadratic matrix constraints (Q2706239) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) (← links)
• Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
• Computational Approaches to Max-Cut (Q2802547) (← links)
• A note on semidefinite relaxation for 0-1 quadratic knapsack problems (Q2867417) (← links)
• SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
• Efficient Use of Semidefinite Programming for Selection of Rotamers in Protein Conformations (Q2940065) (← links)
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
• Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
• A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
• On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming (Q3169131) (← links)
• Copositive realxation for genera quadratic programming (Q4391294) (← links)
• Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
• Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791) (← links)
• A New Relaxation in Conic Form for the Euclidean Steiner Problem in ℜ (Q4546061) (← links)
• Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
• A guide to conic optimisation and its applications (Q4634309) (← links)
• Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (Q4715798) (← links)
• A Derivation of Lovász' Theta via Augmented Lagrange Duality (Q4809664) (← links)
• Convex Relaxations of (0, 1)-Quadratic Programming (Q4864871) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• The Random QUBO (Q5050147) (← links)
• Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
• Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• The omnipresence of Lagrange (Q5920487) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
• Invariants of SDP exactness in quadratic programming (Q6184179) (← links)