Random matching problems on the complete graph.
Random perturbation of the variable metric method for unconstrained nonsmooth nonconvex optimization
We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We introduce a variable metric descent method adapted to nonsmooth situations, which is modified by the incorporation of suitable random perturbations. Convergence to a global minimum is established and a simple method for the generation of suitable perturbations is introduced. An algorithm is proposed and numerical results are presented, showing that the method is computationally effective and stable....
Ranking of Banks in Serbia
Ratio rewards in networks
Rational probabilistic deciders. I: Individual behavior.
Rational probabilistic deciders. II: Collective behavior.
Realization of Knapsack Problem Solving Algorithm and some of Its Applications
Recent Developments and Future Directions in Mathematical Programming
Recherche d'un quasi-ordre médian à partir d'un profil de relations floues
Reconfigurable Dynamic Cellular Manufacturing System: A New Bi-Objective Mathematical Model
Dynamic Cell Formation Problem (DCFP) seeks to cope with variation in part mix and demands using machine relocation, replication, and removing; whilst from practical point of view it is too hard to move machines between cells or invest on machine replication. To cope with this deficiency, this paper addresses Reconfigurable Dynamic Cell Formation Problem (RDCFP) in which machine modification is conducted instead of their relocation or replication in order to enhance machine capabilities to process...
Rectifiabilité quantifié et le problème du voyageur de commerce
Rectifiable sets and the Traveling Salesman Problem.
Recursive form of general limited memory variable metric methods
In this report we propose a new recursive matrix formulation of limited memory variable metric methods. This approach can be used for an arbitrary update from the Broyden class (and some other updates) and also for the approximation of both the Hessian matrix and its inverse. The new recursive formulation requires approximately multiplications and additions per iteration, so it is comparable with other efficient limited memory variable metric methods. Numerical experiments concerning Algorithm...
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
Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
Réductions de graphes et systèmes de Church-Rosser
Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal
Redundance of vertices of the cube relatively to its minimal ellipsoid.