Pages that link to "Item:Q3144407"
From MaRDI portal
The following pages link to Three Ideas for the Quadratic Assignment Problem (Q3144407):
Displaying 13 items.
- Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651) (← links)
- Stabilizer-based symmetry breaking constraints for mathematical programs (Q486387) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- A geometric branch-and-bound algorithm for the service bundle design problem (Q2160490) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
- A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives (Q3466781) (← links)
- A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique (Q5131697) (← links)
- Taking advantage of symmetry in some quadratic assignment problems (Q5884391) (← links)
