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