Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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