Pages that link to "Item:Q1080776"
From MaRDI portal
The following pages link to Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776):
Displaying 10 items.
- Selected topics on assignment problems (Q697571) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Optimization of the quadratic assignment problem using an ant colony algorithm (Q864790) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases (Q2835697) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)