The following pages link to (Q5688490):
Displaying 9 items.
- A branch-and-cut algorithm for quadratic assignment problems based on linearizations (Q856686) (← links)
- Effective formulation reductions for the quadratic assignment problem (Q976022) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems (Q2290902) (← links)
- A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem (Q2815440) (← links)
- A branch-and-bound-based heuristic for solving the quadratic assignment problem (Q3694983) (← links)
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming (Q4868799) (← links)
