Pages that link to "Item:Q976396"
From MaRDI portal
The following pages link to Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396):
Displaying 13 items.
- A new mixed integer programming model for curriculum balancing: application to a Turkish university (Q296758) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- An exact algorithm for the general quadratic assignment problem (Q1067975) (← links)
- Probabilistic tabu search for the cross-docking assignment problem (Q1740539) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints (Q2178343) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- A memetic heuristic for the generalized quadratic assignment problem (Q2892300) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
- Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)
