index - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux Access content directly

The members of MAORE are using the tools of combinatorial optimization, graph theory, mathematical programming, and constraint programming to solve discrete optimization problems exactly or approximately. Our main application fields are:

  • Networks (sensors, IoT, optical)
  • Logistics and transportation (routing, inventory)
  • Energy (production, distribution)
  • Numerical agriculture

Our recent industrial collaborations involve, for instance, Orange, Schneider, Total, and Teads.

Open Access Files

75 %

Number of full texts


Number of records


Publishers' policy on open archives

Mapping of collaborations


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