Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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