Pages that link to "Item:Q3169070"
From MaRDI portal
The following pages link to On the Maximum Quadratic Assignment Problem (Q3169070):
Displaying 13 items.
- The Wiener maximum quadratic assignment problem (Q665991) (← links)
- A subgradient-based continuous-time algorithm for constrained distributed quadratic programming (Q776140) (← links)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093) (← links)
- Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- Approximating the minimum quadratic assignment problems (Q2930294) (← links)
- Maximizing Polynomials Subject to Assignment Constraints (Q3012829) (← links)
- Stochastic Analysis of the Quadratic Assignment Problem (Q3363084) (← links)
- Asymptotic Properties of the Quadratic Assignment Problem (Q3696855) (← links)
- Lov\'asz Meets Weisfeiler and Leman (Q5002713) (← links)
- Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
- On the maximum edge-pair embedding bipartite matching (Q5918365) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)