Pages that link to "Item:Q4302801"

The following pages link to An efficient algorithm for a task allocation problem (Q4302801):

Displaying 18 items.

• Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
• Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization (Q879497) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• A hybrid genetic/optimization algorithm for a task allocation problem (Q1297698) (← links)
• Partitioning multiple-chain-like task across a host-satellite system (Q1313732) (← links)
• Lower bounds for the quadratic semi-assignment problem (Q1388830) (← links)
• The task allocation problem with constant communication. (Q1408823) (← links)
• Algorithms of distributed task allocation for cooperative agents (Q1575532) (← links)
• Assignment of program modules to processors: a simulated annealing approach. (Q1582227) (← links)
• An exact algorithm for the minimum squared load assignment problem (Q1734825) (← links)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search (Q2030481) (← links)
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
• Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique (Q2483337) (← links)
• Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
• New Formulations for the Conflict Resolution Problem in the Scheduling of Television Commercials (Q2830761) (← links)
• Best reduction of the quadratic semi-assignment problem (Q5931788) (← links)
• Parameter tuning of continuous Hopfield network applied to combinatorial optimization (Q6496420) (← links)
• Task assignment in distributed systems using network flow methods (Q6567698) (← links)