index - Archive ouverte HAL Access content directly



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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