En este trabajo se estudia el problema de la búsqueda de una recta de entre n tangentes a una circunferencia. Se da un método para calcular la longitud media óptima del camino recorrido hasta encontrar la recta. Se obtienen ecuaciones que determinan la trayectoria solución de este problema.
Nous présentons, dans cet article, une approche hybride pour la résolution du sac à dos multidimensionnel en variables 0–1. Cette approche combine la programmation linéaire et la méthode tabou. L’algorithme ainsi obtenu améliore de manière significative les meilleurs résultats connus sur des instances jugées difficiles.
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.
This paper deals with the problem of scheduling n tasks on m identical processors in the presence of communication delays. A new approach of modelisation by a decision graph and a resolution by a tabu search method is proposed. Initial solutions are constructed by list algorithms, and then improved by a tabu algorithm operating in two phases. The experiments carried on arbitrary graphs show the efficiency of our method and that it outperformed the principle existent heuristics.