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