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


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