Solving Combinatorial Optimization Problems with Stable Sets Constraints

  Presentation

  Partners

  Missions

  Meetings

  Workgroups

  Publications

  Contact

  Sponsors

  Welcome to our project

This project is entitled Solving Combinatorial Optimization Problems with Stable Sets Constraints. It aims to study optimization problems where some of the constraints are related to stable sets, such as the Maximum Stable Set problem, the Coloring Problem, etc. This class of problems is interesting both for its practical applications and for the numerical and algorithmical challenge that it represents.

Our contributors come from research teams from Brazil (PARGO - Federal University of Ceará, Fortaleza), France (LIA, EA 4128 - University of Avignon and PriSM UMR CNRS 8144 - University of Versailles-Saint Quentin), Chile (Universities of Santiago de Chile and Concepción) and Argentina (National University General Sarmiento).

Besides the scientific interest of the project, our goal is to strengthen the links and cooperations existing between the universities of Ceará, the University of Avignon and the Chilean universities,to extend these collaborations to the University of Versailles Saint Quentin and General Sarmiento,to create the conditions for young researchers, with a special focus on Ph. D. students, of the involved teams to establish their own collaborations.

Main objectives
  • Strengthen and extend a collaboration network
  • Train and form young researchers, specially Ph.D. Students
  • Strengthen doctoral programs of the involved institutions
  • Perform theoretical studies of the polytope induced by the Stable Sets Constraints
  • Design efficient algorithms for solving the studied problems
  • Increase the scientific production (publications) of the involved teams
Recent news

  • First year project report is ready at the publications section of this webpage.