Displaying similar documents to “Informations sur les Journées”

Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances

Marc Demange, Vangelis Paschos (2010)

RAIRO - Operations Research

Similarity:

This paper is the continuation of the paper “” where a new formalism for polynomial approximation and its basic tools allowing an “absolute” (individual) evaluation the approximability properties of -hard problems have been presented and discussed. In order to be used for exhibiting a structure for the class  (the optimization problems of ), these tools must be enriched with an “instrument” allowing comparisons between approximability properties of different problems (these comparisons...

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.