Displaying similar documents to “Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances”

État de l'art des méthodes “d'optimisation globale”

Gérard Berthiau, Patrick Siarry (2010)

RAIRO - Operations Research

Similarity:

We present a review of the main “global optimization" methods. The paper comprises one introduction and two parts. In the introduction, we recall some generalities about non linear constraint-less optimization and we list some classifications which have been proposed for the global optimization methods. We then describe, in the first part, various “classical" global optimization methods, most of which available long before the appearance of Simulated Annealing (a key event in this...

Approximation par des morphismes de chaînes et points fixes des applications multivoques

Robert, Cauty (2012)

Serdica Mathematical Journal

Similarity:

2010 Mathematics Subject Classification: 54C60, 54H25. In this paper, we consider u.s.c. multivalued maps with compact point images. We develop a notion of approximation of such maps by chain mappings between the singular chain complexes of the spaces, and use this notion to prove fixed point theorems.

Sur quelques algorithmes récursifs pour les probabilités numériques

Gilles Pagès (2010)

ESAIM: Probability and Statistics

Similarity:

The aim of this paper is to take an in-depth look at the long time behaviour of some continuous time Markovian dynamical systems and at its numerical analysis. We first propose a short overview of the main ergodicity properties of time continuous homogeneous Markov processes (stability, positive recurrence). The basic tool is a Lyapunov function. Then, we investigate if these properties still hold for the time discretization of these processes, either with constant or decreasing...

Une approche hybride pour le sac à dos multidimensionnel en variables 0–1

Michel Vasquez, Jin-Kao Hao (2010)

RAIRO - Operations Research

Similarity:

We present, in this article, a hybrid approach for solving the 0–1 multidimensional knapsack problem (MKP). This approach combines linear programming and Tabu search. The resulting algorithm improves on the best result on many well-known hard benchmarks.

Une méthode nodale appliquée à un problème de diffusion à coefficients généralisés

Abdelkader Laazizi, Nagib Guessous (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

In this paper, we consider second order neutrons diffusion problem with coefficients in (Ω). Nodal method of the lowest order is applied to approximate the problem's solution. The approximation uses special basis functions [1] in which the coefficients appear. The rate of convergence obtained is in (Ω), with a free rectangular triangulation.

Coloration de graphes : fondements et applications

Dominique de Werra, Daniel Kobler (2010)

RAIRO - Operations Research

Similarity:

The classical colouring models are well known thanks in large part to their applications to scheduling type problems; we describe the basic concepts of colourings together with a number of variations and generalisations arising from scheduling problems such as the creation of school schedules. Some exact and heuristic algorithms will be presented, and we will sketch solution methods based on tabu search to find approximate solutions to large problems. Finally we will also mention...

Sur des inégalités intégrales et applications à la stabilité de quelques systèmes distribués non dissipatifs

Aïssa Guesmia

Similarity:

First we prove some new integral inequalities to obtain a precise estimate on behavior at infinity of a positive and not necessarily decreasing functon. This extends in many directions and improves in certain cases some integral inequalities due to A. Haraux, V. Komornik, P. Martinez, M. Eller et al. and F. Alabau-Boussouira concerning decreasing functions. Then we give applications to (internal or boundary, linear or nonlinear) stabilization of certain nondissipative distributed...