Algorithms and Optimization
icteam | Louvain-la-Neuve
Algorithms and Optimization form the theoretical foundation for intelligent decision-making and computational efficiency. This field explores the principles and application of algorithms and optimization methods to solve complex, constrained, real-world problems across science, engineering, and society.
Key research areas include:
Discrete Optimization Techniques – Designing scalable, high-performance methods for combinatorial and integer optimization problems.
Continuous Optimization – Solving real-time, constrained optimization problems central to control, decision-making, and resource allocation.
Algorithm Design & Efficiency – Developing efficient algorithms with provable guarantees for large-scale and time-critical computations.
Constraint Satisfaction & Reasoning – Solving high-dimensional decision problems under constraints with formal methods and heuristics in discrete spaces.
Meet the Professors
(by alphabetical order)