index - Archive ouverte HAL Access content directly



  Methods, Algorithms for Operations REsearch

Consult your copyright

Number of Files


Nomber of Notices


Collaborations’ map


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