Optimal constructions of event-node networks
Optimal Distribution Centers Involving Supply Capacity, Demands and Budget Restriction
Optimal tool partitioning rules for numerically controlled punch press operations
Optimal tour planning with specified nodes
Optimale Aufteilung des Stichprobenumfangs bei mehreren Merkmalen.
Optimization and Highly Informative Graph Invariants
Optimization by a method of maximum slope in the complex plane and its application to the transportation problem
Optimization of Air Distribution in Mine Ventilation Networks
Optimization of power transmission systems using a multi-level decomposition approach
We discuss the use of operations research methods for computer-aided design of mechanical transmission systems. We consider how to choose simultaneously transmission ratios and basic design parameters of transmission elements (diameters, widths, modules and tooth number for gears, diameters of shafts). The objectives, by the order of importance, are: to minimize the deviation of the obtained speeds from desired; to maximize the transmission life; to minimize the total mass. To solve this...
Optimum workforce scheduling under the (14, 21) days-off timetable.
Ordres médians et ordres de Slater des tournois
Dans cet article, nous essayons de faire le point sur les résultats concernant les aspects combinatoires et algorithmiques des ordres médians et des ordres de Slater des tournois. La plupart des résultats recensés sont tirés de différentes publications ; plusieurs sont originaux.
Plus court chemin avec contraintes d'horaires
Plus court chemin avec dépendance horaire : résolution et application aux problèmes de tournées
Polynomially solvable traveling salesman problems
Primal-dual approximation algorithms for a packing-covering pair of problems
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit capacities. In each case we describe a simple algorithm that outputs a solution to the packing problem and...
Primal-dual approximation algorithms for a packing-covering pair of problems
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit capacities. In each case we describe a simple algorithm that outputs a solution to the packing problem and...
Problème de la bipartition minimale d'un graphe
Problèmes de partitionnement : exploration arborescente ou méthode de troncatures ?
Problemi di taglio minimo con vincoli di cardinalità
Procédure automatique d'examen de dossiers fondée sur une segmentation trichotomique en présence de critères multiples