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):
Displayed 20 items.
- 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)
- Convergence of a modified algorithm of fast probabilistic modeling (Q946727) (← 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)
- 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)
- 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)
- 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)