Pages that link to "Item:Q2770106"
From MaRDI portal
The following pages link to Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation (Q2770106):
Displayed 10 items.
- Selected topics on assignment problems (Q697571) (← links)
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A level-2 reformulation-linearization technique bound for the quadratic assignment problem (Q872113) (← links)
- Mapping the convergence of genetic algorithms (Q955480) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- The quadratic three-dimensional assignment problem: exact and approximate solution methods (Q2384611) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)