Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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