Pages that link to "Item:Q856686"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686):
Displaying 5 items.
- Linearizable special cases of the QAP (Q266060) (← links)
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- Experimental analysis of crossover and mutation operators on the quadratic assignment problem (Q513133) (← links)
- A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
