Pages that link to "Item:Q4022029"
From MaRDI portal
The following pages link to A New Lower Bound Via Projection for the Quadratic Assignment Problem (Q4022029):
Displaying 39 items.
- Convex hull of the orthogonal similarity set with applications in quadratic assignment problems (Q380503) (← links)
- On improving convex quadratic programming relaxation for the quadratic assignment problem (Q498438) (← links)
- Global optimization of a class of nonconvex quadratically constrained quadratic programming problems (Q644622) (← links)
- Laplace eigenvalues of graphs---a survey (Q686298) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Bounds for the quadratic assignment problem using the bundle method (Q868474) (← links)
- Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
- Convergence of a modified algorithm of fast probabilistic modeling (Q946727) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality (Q1187508) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
- A note on lack of strong duality for quadratic problems with orthogonal constraints (Q1848387) (← links)
- Solving the max-cut problem using eigenvalues (Q1900149) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- A modification of threshold accepting and its application to the quadratic assignment problem (Q1909011) (← links)
- Lower bounds for the quadratic assignment problem via triangle decompositions (Q1914071) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← 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)
- An efficient continuation method for quadratic assignment problems (Q2654391) (← links)
- Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
- On the equivariance properties of self-adjoint matrices (Q3298332) (← links)
- A New Lower Bound for the Quadratic Assignment Problem (Q3990559) (← links)
- Matrix differential equations: a continuous realization process for linear algebra problems (Q4030882) (← links)
- A spectral approach to bandwidth and separator problems in graphs (Q4853927) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
- A new bound for the quadratic assignment problem based on convex quadratic programming (Q5930731) (← links)
- Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676) (← links)
