Algorithm 49. An algorithm for solving the machine sequencing problem
Algorithm 5. Solution of the transportation problem by bridges dual labeling method
Algorithm 51. Solution of linear programming problems in zero-one variables
Algorithm 69. Two distances between hypergraphs
Algorithm for turnpike policies in the dynamic lot size model
This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine...
Algorithme d'approximation interne de problèmes de point de selle avec contraintes via l'optimisation
Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
Algorithmes de programmation convexe par linéarisation en format constant
Algorithmes de type F.A.C. en optimisation convexe
Algorithmes génétiques hybrides pour l'optimisation combinatoire
Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
Nous présentons dans cet article un algorithme générique hybride permettant de combiner des méthodes complètes (programmation par contraintes) et incomplètes (recherche locale) pour la résolution de problèmes de satisfaction de contraintes. Ce schéma algorithmique basé sur la gestion de populations, utilise des techniques de propagation de contraintes intégrant également des heuristiques de recherche locale. Les structures utilisées autorisent une interaction homogène entre les différentes méthodes...
Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
Nous présentons dans cet article un algorithme générique hybride permettant de combiner des méthodes complètes (programmation par contraintes) et incomplètes (recherche locale) pour la résolution de problèmes de satisfaction de contraintes. Ce schéma algorithmique basé sur la gestion de populations, utilise des techniques de propagation de contraintes intégrant également des heuristiques de recherche locale. Les structures utilisées autorisent une interaction homogène entre les différentes méthodes...
Algorithmes polynomiaux pour la recherche d'un chemin optimal dans une scène planifiée
Algorithms 77-78. Uniform approximation of empirical functions being either monotone or having a fixed number of extrema
Algorithms construction for variational inequalities.
Algorithms for Bound Constrained Quadratic Programming Problems.
Algorithms for general mixed quasi variational inequalities.
Algorithms for the two dimensional bin packing problem with partial conflicts
The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a 2BP with distance...
Algorithms for the two dimensional bin packing problem with partial conflicts
The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a 2BP with distance...
Algoritmi di ottimizzazione globale