Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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