Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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