Pages that link to "Item:Q3694983"
From MaRDI portal
The following pages link to A branch-and-bound-based heuristic for solving the quadratic assignment problem (Q3694983):
Displayed 17 items.
- Efficient models for the facility layout problem (Q803026) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- The facility layout problem (Q1088577) (← links)
- A heuristic method for the multi-story layout problem (Q1107411) (← links)
- Backtracking of jobs in one-dimensional machine location problems (Q1127161) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Large-scale layout of facilities using a heuristic hybrid algorithm (Q1337243) (← links)
- A genetic approach to the quadratic assignment problem (Q1342320) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- A heuristic procedure for the single-row facility layout problem (Q1390259) (← links)
- Directional decomposition heuristic for a linear machine-cell location problem. (Q1811151) (← links)
- A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem (Q1821011) (← links)
- A hybrid heuristic for the facilities layout problem (Q2276871) (← links)
- A directional decomposition heuristic for one-dimensional, non-equidistant machine-cell location problems (Q2565770) (← links)
- Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple (Q6116659) (← links)