Pages that link to "Item:Q1821011"
From MaRDI portal
The following pages link to A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011):
Displaying 12 items.
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem (Q793639) (← links)
- On a special case of the quadratic assignment problem with an application to storage-and-retrieval devices (Q817149) (← links)
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem (Q850313) (← links)
- A note on a polynomial time solvable case of the quadratic assignment problem (Q865755) (← links)
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems (Q1080776) (← links)
- Backtracking of jobs in one-dimensional machine location problems (Q1127161) (← links)
- An algorithm for quadratic assignment problems (Q1130047) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- A new heuristic for the quadratic assignment problem (Q1428288) (← links)
- A heuristic method for the quadratic assignment problem (Q1429397) (← links)
- Optimal sequences in stochastic single machine shops (Q1919778) (← links)
- A branch-and-bound-based heuristic for solving the quadratic assignment problem (Q3694983) (← links)
