Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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