Random matching problems on the complete graph.
Realization of Knapsack Problem Solving Algorithm and some of Its Applications
Rectifiable sets and the Traveling Salesman Problem.
RedInv-SA : a simulated annealing for the quadratic assignment problem
Redinv-SA: la simulated annealing for the quadratic assignment problem
An algebraic and combinatorial approach to the study of the Quadratic Assignment Problem produced theoretical results that can be applied to (meta) heuristics to give them information about the problem structure, allowing the construction of algorithms. In this paper those results were applied to inform a Simulated Annealing-type heuristic (which we called RedInv-SA). Some results from tests with known literature instances are presented.
Reducing Off-Line to On-Line: an Example and Its Applications
Reformulations in Mathematical Programming: Definitions and Systematics
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts to move...