Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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