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
Product form parametric representation of the solutions to a quadratic boolean equation
Programmation linéaire mixte : conditions de validité dans les méthodes arborescentes