quadratic assignment problem

基本解释

A Modified Ant Colony Algorithm for the Quadratic Assignment Problem;
本文给出了一种求解二次指派问题的混合演化策略。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题，概述了ACO在静态组合最优化和动态组合优化问题中的应用。
The processing task assignment is formulated as a quadratic 0-1 programming problem, and a distributed OALL algorithm (optimizing assignment layer by layer) is proposed.
针对处理任务分配，将其建模为二次0-1规划问题，并提出了分布式逐层优化分配算法OALL。