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