Loading...
Les membres de l’équipe MAORE utilisent les outils de l’optimisation combinatoire, de la théorie des graphes, de la programmation mathématique et de la programmation par contraintes pour résoudre des problèmes d’optimisation discrets de manière exacte ou approchée. Les principaux domaines d’application couvrent:
Les contrats industriels récents impliquent, par exemple, Orange, Schneider, Total, et Teads. |
Open Access Files74 % |
Nombre de Fichiers déposés208 |
|
Nombre de Notices déposées90 |
Politique des éditeurs en matière de dépôt dans une archive ouverte
Cartographie des collaborations
Tags
Exact methods
Robust combinatorial optimization
Coupled-task scheduling model
Complexity & approximation
Linear and mixed-integer programming
Constraint programming
Degree constrained minimum spanning hierarchy
Approximation algorithms
Multicast
RPL
Coupled-tasks
Complexity
Quality of Service
Dynamic Programming
Clearing algorithms
Wireless sensor networks
Spanning tree
Homomorphisme
NP-hardness
Light-tree
K-MBVST
K-adaptability
Chordal graphs
Branch vertices constraint
Bilevel optimization
Fault-tolerance
Multicommodity flows
Branch-and-Cut
Affine routing
Branch and Price
Approximation
Integer Programming
Approximability
Genome scaffolding
ILP
Grover algorithm
Bi-level programming
Robust optimization
Scheduling
WDM network
Robust Optimization
Column generation
Approximation algorithm
Approximation ratio
Graph theory
Bass model
Spanning problems
Checkpointing
Heuristic
Routing
Compatibility graph
Multicast routing
Light-hierarchy
Quantum optimization
Computational complexity
Parallel job
Constrained shortest path
Cutting plane
IoT
Free space optics
Energy-aware engineering
Path generation
Scaffolding
Capacity Expansion
Linear programming
Integer programming
Branch-cut-and-price
Combinatorial optimization
Light-forest
Optimisation
FPT algorithm
Optimization
FPTAS
Dynamic programming
Network design
All-optical WDM networks
Column Generation
Hierarchy
Combinatorial Optimization
Investments optimization
Time windows
Quality of service
Complexité
Exascale
Integer Linear Programming ILP
Sparse splitting
Light-trail
IoT networks
Wavelength minimization
Variable link capacity
Replication
Optimisation combinatoire
FSO
Model Driven Engineering
Vehicle routing
Budgeted uncertainty
Benders decomposition
K-Adaptability
Réseaux de capteurs
Homomorphism