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