Skip to Main content Skip to Navigation
 

Search

MAORE

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

Consult your copyright

 
     

Consulter la politique des éditeurs également sur

Number of Files

128

Nomber of Notices

113

Collaborations’ map

Tags

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