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