Reduction of dimensionality in dynamic programming-based solution methods for nonlinear integer programming.
Réductions de graphes et systèmes de Church-Rosser
Représentation de familles ordonnées d'intervalles et applications
Représentation de matrices euclidiennes en vue de leur génération aléatoire
Reservation table scheduling: branch-and-bound based optimization vs. integer linear programming techniques
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target architecture....
Résolution de programmes linéaires entiers ou mixtes à l'aide de la forme normale de Hermite
Résolution des problèmes de multiflots en nombres entiers dans les grands réseaux