Pages that link to "Item:Q1124328"
From MaRDI portal
The following pages link to Algorithms for assignment problems on an array processor (Q1124328):
Displaying 18 items.
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem (Q443828) (← links)
- An orthogonal systolic design for the assignment problem (Q922683) (← links)
- The single-finger keyboard layout problem (Q1025249) (← links)
- An assignment algorithm with applications to integrated circuit layout (Q1069442) (← links)
- A parallel branch and bound algorithm for the quadratic assignment problem (Q1095791) (← links)
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks (Q1336877) (← links)
- Correct translation of data parallel assignment onto array processors (Q1336950) (← links)
- A study of diversification strategies for the quadratic assignment problem (Q1342106) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- An efficient processor allocation algorithm using two-dimensional packing (Q1370849) (← links)
- A user's guide to tabu search (Q2366991) (← links)
- \(D\&C\) method for solving large problems in fixed size processor array (Q2751940) (← links)
- \(L_p\)-norm regularization algorithms for optimization over permutation matrices (Q2832890) (← links)
- A Multistage Linear Array Assignment Problem (Q3210145) (← links)
- An algorithm for assigning multiplexer inputs (Q3476267) (← links)
- A systolic array for the assignment problem (Q3802894) (← links)
- (Q4283457) (← links)
- Aligators for Arrays (Tool Paper) (Q4933316) (← links)