Méthodes Algorithmes pour l'Ordonnancement et les Réseaux

Consult your copyright


Consulter la politique des éditeurs également sur

Number of Files


Nomber of Notices


Collaborations’ map


Coupled-tasks Multicast routing Wireless sensor networks Free space optics Exascale Chordal graphs Graph theory FPT algorithm Approximation Scheduling Constraint programming Branch and Price Constrained shortest path Branch vertices constraint Budgeted uncertainty P-cycle Column generation Mixed-integer programming Scaffolding Light-tree Multidimensional binary vector assignment Integer Programming Cutting plane Robust optimization Robust combinatorial optimization Hierarchy Homomorphism Integer programming K-adaptability Light-hierarchy Perfect information Approximability Complexity Approximation algorithms Ordonnancement Branch-and- Cut Routing protocols Benders decomposition Bi-level programming Complexity & approximation Spanning tree Multi-trip Multicast Routing Lot-sizing problem Multicast Quality of Service Polynomial-time approximation algorithm Shortest paths Path generation MBVST Approximation algorithm Multicommodity flows Optimisation Heuristic Time windows Polynomial-time algorithm RPL Optimization Vehicle routing Optimisation combinatoire Resilience Multi-stage robust optimization Coupled-task scheduling model Light-trail Spanning Hierarchy Partial minimum spanning hierarchy Model Driven Engineering Multiple strip packing Fault-tolerance Parallel job Dynamic programming Network design Approximation ratio Réseaux de capteurs All-optical multicast routing Light-forest Linear and mixed-integer programming Degree-Constrained Spanning Problem Complexité ILP Multi-constrained Steiner problem Wavelength minimization Lifetime Energy-aware engineering Homomorphisme WDM network All-optical WDM networks Replication Routing Sparse splitting Combinatorial optimization Branch-and-Cut Column Generation Matching Routage multicast Compatibility graph Localisation Quality of service K-MBVST Checkpointing