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