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):
Displayed 10 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)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems (Q6086024) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
- A new formulation and an effective matheuristic for the airport gate assignment problem (Q6109287) (← links)