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