Theme Combinatorial optimization


This theme involves modelling and research into efficient algorithms for various optimisation problems arising from operations research and applied mathematics. The application context is very broad, ranging from continuous to discrete, from deterministic to stochastic, from graphs to algorithmic complexity.
 The nature of the optimisation problems studied is :

    Combinatorial: finding the smallest or largest element from a finite set of elements. Variables take integer values.

    Continuous: find the smallest or largest point in a non-countable infinite set. Variables can take real values.

Combinatorial optimisation problems are studied using several approaches depending on their difficulty and structure:

  • Polyhedral approaches: the aim is to reduce the problem to the solution of a linear programme. This task is impossible when the problem in question is NP-complete, but the determination of a relaxed linear program is easy and generally offers very useful bounds for starting the solution using branch-and-bound-and-cut algorithms. These are the best-performing exact algorithms for solving difficult combinatorial optimisation problems. This approach is also used to describe instances where an NP-complete problem becomes polynomial. This is achieved by completely describing the polytope associated with the problem by a linear program with constraints that are easy to separate (we can introduce the constraints needed for optimisation in polynomial time despite their exponential number in most cases).
  • Approximation algorithms: this involves developing polynomial algorithms in which the value of the solution found is analytically comparable to the value of the optimal solution. The measure taken is the worst-case approximation ratio between the value found and the value of the optimum. Average approximation ratio measures are also considered where this can be defined.
  • Game algorithms: This involves combining mathematics, economics and computer science to manage situations where individual interests conflict with the common welfare. The application of algorithms is recent: the aim is to find the right strategies to ensure stability in exchanges between individuals and in the sharing of common resources. Game algorithms emphasise the complexity of calculating these equilibria and rely on performance-guaranteed bounds and approximations to respond to models whose exact solutions are unrealistic or unknown.
  • Stochastic and robust optimisation: In many applications, the data is not known exactly. The associated uncertainty is often represented by several scenarios. These different scenarios are usually modelled by adding new variables and constraints.

The problems studied come from a variety of fields: transport networks, telecommunication networks, electricity networks, bioinformatics, sensor networks, infrastructure localisation, nuclear and automotive.

Last publications

Minh Hieu Nguyen, Mourad Baiou, Viet Hung Nguyen, Thi Quynh Trang Vo - March 18, 2024
Proportional Fairness for Combinatorial Optimization
Latin American Theoretical Informatics Symposium (LATIN 2024)

Minh Hieu Nguyen, Mourad Baiou, Viet Hung Nguyen - Feb. 3, 2024
Generalized Nash Fairness solutions for Bi-Objective Discrete Optimization: Theory and Algorithms

José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler - Jan. 13, 2024
Managing Time Expanded Networks: The Strong Lift Problem

José Luis Figueroa González, Alain Quilliot, Hélène Toussaint, Annegret Wagler - Dec. 7, 2023
Managing a Time Expanded Network through Project-and-Lift
SOICT 2023: The 12th International Symposium on Information and Communication Technology

Pedro Henrique Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Wagler - Nov. 28, 2023
Solving the routing and spectrum assignment problem, driven by combinatorial properties

Fatiha Bendali, Jean Mailfert, Eloise Mole Kamga, Alain Quilliot, Hélène Toussaint - Sept. 5, 2023
Models, Algorithms and Approximation Results for a Bi-Level Synchronized Knapsack Problem
Cybernetics and Systems

Timothée Martinod - July 4, 2023
Étude de complexité algorithmique pour des problèmes de domination et de tournées dans les graphes avec obligations

Thi Quynh Trang Vo, Mourad Baiou, Viet Hung Nguyen, Paul Weng - June 4, 2023
Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning
17th learning and intelligent optimization conference

Thi Quynh Trang VO, Mourad Baiou, Viet Hung Nguyen - May 22, 2023
A Branch-and-Cut algorithm for the Balanced Traveling Salesman Problem

Aurélien Mombelli, Alain Quilliot, Mourad Baiou - Feb. 21, 2023
A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem

All publications are here