Loading...
The members of MAORE are using the tools of combinatorial optimization, graph theory, mathematical programming, and constraint programming to solve discrete optimization problems exactly or approximately. Our main application fields are:
Our recent industrial collaborations involve, for instance, Orange, Schneider, Total, and Teads. |
Open Access Files75 % |
Number of full texts215 |
|
Number of records92 |
Publishers' policy on open archives
Mapping of collaborations
Tags
Branch vertices constraint
RPL
Column Generation
Fault-tolerance
Light-hierarchy
Integer Programming
FPT algorithm
Cutting plane
Path generation
Wireless sensor networks
Homomorphisme
Network design
Spanning tree
Combinatorial optimization
Complexité
Compatibility graph
Robust optimization
All-optical WDM networks
IoT networks
Multicast routing
Homomorphism
Integer programming
Exact methods
Benders decomposition
Computational complexity
Budgeted uncertainty
Free space optics
Graph theory
Quantum optimization
Réseaux de capteurs
Approximation algorithms
Approximation ratio
WDM network
Chordal graphs
Spanning problems
Robust combinatorial optimization
K-Adaptability
Heuristic
Clearing algorithms
Bass model
Approximability
Multicast
Branch and Price
Vehicle routing
ILP
Quantum computing
Replication
NP-hardness
Model Driven Engineering
Bi-level programming
Optimization
Complexity
Dynamic Programming
Approximation algorithm
Parallel job
Energy-aware engineering
Genome scaffolding
Branch-cut-and-price
Hierarchy
Combinatorial Optimization
Sparse splitting
Constrained shortest path
Optimisation
Investments optimization
Time windows
Linear programming
Linear and mixed-integer programming
Multicommodity flows
Exascale
Coupled-tasks
Complexity & approximation
Integer Linear Programming ILP
Degree constrained minimum spanning hierarchy
Column generation
Light-forest
IoT
Constraint programming
Coupled-task scheduling model
Light-trail
Light-tree
Optimisation combinatoire
Quality of service
Grover algorithm
Scaffolding
Checkpointing
FSO
Bilevel optimization
Wavelength minimization
Scheduling
Variable link capacity
Approximation
K-MBVST
Branch-and-Cut
Robust Optimization
Routing
Quality of Service
Capacity Expansion
Dynamic programming
FPTAS
Affine routing