Pages that link to "Item:Q367651"
From MaRDI portal
The following pages link to Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers (Q367651):
Displaying 15 items.
- 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)
- Two classes of quadratic assignment problems that are solvable as linear assignment problems (Q665995) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems (Q1615968) (← links)
- New linearizations of quadratic assignment problems (Q1761235) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- A hybrid method integrating an elite genetic algorithm with tabu search for the quadratic assignment problem (Q2666872) (← links)
- The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows (Q2962560) (← links)
- (Q3220358) (← links)
- A new linearization method for quadratic assignment problems (Q3423596) (← links)
- (Q3626447) (← links)
- Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization (Q4634103) (← links)
- Facility layout problem with QAP formulation under scenario-based uncertainty (Q5882273) (← links)