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 19 items.
- Linearizable special cases of the QAP (Q266060) (← links)
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← 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)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- Exact algorithms for the quadratic linear ordering problem (Q2899047) (← links)
- A new linearization method for quadratic assignment problems (Q3423596) (← links)
- A branch-and-bound-based heuristic for solving the quadratic assignment problem (Q3694983) (← links)
- An experimental study of variable depth search algorithms for the quadratic assignment problem (Q4904331) (← links)
- (Q5688490) (← 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)
