Pages that link to "Item:Q3990559"
From MaRDI portal
The following pages link to A New Lower Bound for the Quadratic Assignment Problem (Q3990559):
Displayed 12 items.
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing (Q703914) (← links)
- QAPLIB-A quadratic assignment problem library (Q807376) (← links)
- A quadra-directional decomposition heuristic for a two-dimensional, non-equidistant machine-cell location problem (Q850313) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- A parallel depth first search branch and bound algorithm for the quadratic assignment problem (Q1130079) (← links)
- Network-based formulations of the quadratic assignment problem (Q1291651) (← links)
- One-dimensional machine location problems in a multi-product flowline with equidistant locations (Q1291754) (← links)
- An optimal tree search method for the manufacturing systems cell formation problem (Q1291773) (← links)
- A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method (Q1296800) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A new exact algorithm for the solution of quadratic assignment problems (Q1343146) (← links)
- Lower bounds based on linear programming for the quadratic assignment problem (Q1804578) (← links)