Pages that link to "Item:Q2507561"
From MaRDI portal
The following pages link to Finding a cluster of points and the grey pattern quadratic assignment problem (Q2507561):
Displaying 7 items.
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
- A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
- Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
- An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
