Solving Lift-and-Project Relaxations of Binary Integer Programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 437548
- scientific article; zbMATH DE number 1187158
- Linear-programming-based lifting and its application to primal cutting-plane algorithms
- Strong lift-and-project cutting planes for the stable set problem
- Combining semidefinite and polyhedral relaxations for integer programs
Cited in
(49)- An algorithm for the generalized quadratic assignment problem
- On the Lovász theta function and some variants
- A new lift-and-project operator
- Measuring instance difficulty for combinatorial optimization problems
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A proximal augmented method for semidefinite programming problems
- An application of the Lovász-Schrijver M(K, K) operator to the stable set problem
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices
- The stable set problem: clique and nodal inequalities revisited
- Block coordinate descent methods for semidefinite programming
- Projection Methods in Conic Optimization
- SDP relaxations for some combinatorial optimization problems
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem
- Strengthening Chvátal-Gomory cuts for the stable set problem
- An alternating direction method for solving convex nonlinear semidefinite programming problems
- Ellipsoidal relaxations of the stable set problem: theory and algorithms
- Douglas-Rachford splitting method for semidefinite programming
- Strong lift-and-project cutting planes for the stable set problem
- Manifold relaxations for integer programming
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- scientific article; zbMATH DE number 2084778 (Why is no real title available?)
- Scalable semidefinite programming
- Mathematical programming models and exact algorithms
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
- Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters
- Exact solution of two location problems via branch-and-bound
- Taking advantage of symmetry in some quadratic assignment problems
- Semidefinite approximations for quadratic programs over orthogonal matrices
- Partitioning through projections: strong SDP bounds for large graph partition problems
- Sinkhorn Algorithm for Lifted Assignment Problems
- Alternating direction augmented Lagrangian methods for semidefinite programming
- The augmented Lagrangian methods: overview and recent advances
- Application of the Lovász-Schrijver operator to compact stable set integer programs
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A survey for the quadratic assignment problem
- A boundary point method to solve semidefinite programs
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Bounds for the quadratic assignment problem using the bundle method
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A new relaxation framework for quadratic assignment problems based on matrix splitting
- Valid inequalities for mixed integer linear programs
This page was built for publication: Solving Lift-and-Project Relaxations of Binary Integer Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470217)
