Pages that link to "Item:Q834180"
From MaRDI portal
The following pages link to Copositive and semidefinite relaxations of the quadratic assignment problem (Q834180):
Displaying 50 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets (Q360522) (← links)
- Moment approximations for set-semidefinite polynomials (Q382904) (← links)
- A note on set-semidefinite relaxations of nonconvex quadratic programs (Q386483) (← links)
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) (← links)
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- Quadratic factorization heuristics for copositive programming (Q542052) (← links)
- Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- LP-based tractable subcones of the semidefinite plus nonnegative cone (Q1657406) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems (Q1756793) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
- Sign patterns of inverse doubly-nonnegative matrices (Q2228119) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Completely positive reformulations for polynomial optimization (Q2349130) (← links)
- Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems (Q2436689) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
- Copositive Programming (Q2802526) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming (Q2805705) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP (Q5106411) (← links)
