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