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


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