二次指派问题的O（1）Delta分量计算技术
O(1) Delta Component Computation Technique for the Quadratic Assignment Problem
摘要：
本文描述了一种新的技术，允许减少一半的delta值的数量，需要计算的复杂度为O（N），在大多数的二次分配问题的算法。利用在这项工作中获得的新旧delta值之间的相关性，提出了一个新的复杂度为O（1）的公式。发现的结果导致高达25%的性能提高，如鲁棒禁忌搜索和其他知名的算法基于它。
英文摘要：
The paper describes a novel technique that allows to reduce by half the number of delta values that were required to be computed with complexity O(N) in most of the heuristics for the quadratic assignment problem. Using the correlation between the old and new delta values, obtained in this work, a new formula of complexity O(1) is proposed. Found result leads up to 25% performance increase in such well-known algorithms as Robust Tabu Search and others based on it.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
