Pages that link to "Item:Q5470217"

The following pages link to Solving Lift-and-Project Relaxations of Binary Integer Programs (Q5470217):

Displaying 45 items.

• Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
• Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180) (← links)
• Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound (Q839489) (← links)
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• A boundary point method to solve semidefinite programs (Q858180) (← links)
• Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
• Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
• Valid inequalities for mixed integer linear programs (Q995784) (← links)
• An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
• On the Lovász theta function and some variants (Q1751239) (← links)
• A new lift-and-project operator (Q1752818) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• Globally solving nonconvex quadratic programming problems via completely positive programming (Q1762459) (← links)
• A proximal augmented method for semidefinite programming problems (Q2048441) (← links)
• An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations (Q2476994) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
• The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
• Block Coordinate Descent Methods for Semidefinite Programming (Q2802537) (← links)
• Projection Methods in Conic Optimization (Q2802538) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem (Q2815440) (← links)
• Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
• An alternating direction method for solving convex nonlinear semidefinite programming problems (Q2841143) (← links)
• Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
• Scalable Semidefinite Programming (Q4999352) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
• Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters (Q5139631) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
• Sinkhorn Algorithm for Lifted Assignment Problems (Q6133998) (← links)