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