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