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


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