2 papers
cs.AI2024
Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances
Sébastien Verel, Sarah Thomson, Omar Rifki
The Quadratic Assignment Problem (QAP) is one of the major domains in the field of evolutionary computation, and more widely in combinatorial optimization. This paper studies the p…
math.OC2023
Traveling salesman problem with time slots: Asymptotic analysis and resolution algorithm
Omar Rifki, Thierry Garaix
We develop an asymptotic approximation and bounds for the traveling salesman problem with time slots, i.e. when the time windows of points to visit are a partition of a given time…