Skip to Main content Skip to Navigation



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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