Semidefinite programming relaxations for the quadratic assignment problem
From MaRDI portal
Recommendations
- Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- scientific article; zbMATH DE number 1894380
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
Cited in
(98)- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- Quadratic maximization and semidefinite relaxation
- On the Slater condition for the SDP relaxations of nonconvex sets
- ADMM for the SDP relaxation of the QAP
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph
- The demand weighted vehicle routing problem
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- On self-regular IPMs (with comments and rejoinder)
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- A note on lack of strong duality for quadratic problems with orthogonal constraints
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Strong duality and minimal representations for cone optimization
- Semidefinite programming relaxations for the graph partitioning problem
- A proximal DC approach for quadratic assignment problem
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
- Image matching from handcrafted to deep features: a survey
- A time-triggered dimension reduction algorithm for the task assignment problem
- Convex graph invariant relaxations for graph edit distance
- A survey of hidden convex optimization
- Immediate schedule adjustment and semidefinite relaxation
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables
- An exact semidefinite programming approach for the max-mean dispersion problem
- Local minima and convergence in low-rank semidefinite programming
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Semidefinite spectral clustering
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
- 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
- Efficient random graph matching via degree profiles
- Lower bounds for the bandwidth problem
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- On Lagrangian relaxation of quadratic matrix constraints
- Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
- Solving quadratic assignment problems using convex quadratic programming relaxations
- Relaxations of combinatorial problems via association schemes
- SDP relaxations for some combinatorial optimization problems
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- Efficient use of semidefinite programming for selection of rotamers in protein conformations
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- An efficient semidefinite programming relaxation for the graph partition problem
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A low-dimensional semidefinite relaxation for the quadratic assignment problem
- Convex quadratic and semidefinite programming relaxations in scheduling
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- scientific article; zbMATH DE number 5152705 (Why is no real title available?)
- Convex relaxations for permutation problems
- A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Exact recovery with symmetries for the doubly stochastic relaxation
- scientific article; zbMATH DE number 1894380 (Why is no real title available?)
- Contribution of copositive formulations to the graph partitioning problem
- A polynomial time constraint-reduced algorithm for semidefinite optimization problems
- Fixing Variables in Semidefinite Relaxations
- Algorithm 996
- On improving convex quadratic programming relaxation for the quadratic assignment problem
- Scalable semidefinite programming
- Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
- Semidefinite programming relaxations of the traveling salesman problem and their integrality gaps
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Hidden Hamiltonian cycle recovery via linear programming
- Quadratic Combinatorial Optimization Using Separable Underestimators
- On semidefinite programming bounds for graph bandwidth
- scientific article; zbMATH DE number 2200751 (Why is no real title available?)
- Algorithms – ESA 2005
- Exact solution of two location problems via branch-and-bound
- Preprocessing and regularization for degenerate semidefinite programs
- Validating numerical semidefinite programming solvers for polynomial invariants
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
- Gangster operators and invincibility of positive semidefinite matrices
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- A note on the SDP relaxation of the minimum cut problem
- Semidefinite approximations for quadratic programs over orthogonal matrices
- scientific article; zbMATH DE number 7716275 (Why is no real title available?)
- Sinkhorn Algorithm for Lifted Assignment Problems
- Exact SDP relaxations for quadratic programs with bipartite graph structures
- Moment inequalities for sums of random matrices and their applications in optimization
- A strengthened SDP relaxation for quadratic optimization over the Stiefel manifold
- The MIN-cut and vertex separator problem
- An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
- Selected topics on assignment problems
- Semidefinite programming for discrete optimization and matrix completion problems
- Sum-of-squares hierarchy for the Gromov-Wasserstein problem
- Closing the duality gap of the generalized trace ratio problem
- Fixing variables in semidefinite relaxations
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- A survey for the quadratic assignment problem
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- Bounds for the quadratic assignment problem using the bundle method
- Effective formulation reductions for the quadratic assignment problem
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A new relaxation framework for quadratic assignment problems based on matrix splitting
This page was built for publication: Semidefinite programming relaxations for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386486)
