Pages that link to "Item:Q1822955"
From MaRDI portal
The following pages link to An algorithm for the multiprocessor assignment problem (Q1822955):
Displaying 17 items.
- A survey for the quadratic assignment problem (Q852928) (← links)
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique (Q976396) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Personnel placement in a fuzzy environment (Q1185999) (← links)
- An improved partial solution to the task assignment and multiway cut problems (Q1200754) (← links)
- A polynomially solvable class of quadratic semi-assignment problems (Q1278260) (← links)
- Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
- The task allocation problem with constant communication. (Q1408823) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
- A Lagrangian relaxation algorithm for sparse quadratic assignment problems (Q1904611) (← links)
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
- Algorithm for quadratic semi-assignment problem with partition size coefficients (Q2448190) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Exact solution of emerging quadratic assignment problems (Q3002542) (← links)
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating (Q5139608) (← links)
