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


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