Skip to Main content Skip to Navigation
New interface



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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