Marc Etheve

Marc Etheve

PhD Student
Team: Optimisation combinatoire
Personal website:
Office: 31.1.73

2021

Conference Articles

  1. Alès, Z.; Etheve, M.; Bissuel, C.; Juan, O. and Kedad-Sidhoum, S. On learning node selection in a branch and bound algorithm. In Conférence ROADEF 2021, Mulhouse, France, 2021. www 

PhD Theses

  1. Etheve, M. Solving repeated optimization problems by Machine Learning. Ph.D. Thesis, HESAM Université, 2021.

2020

Book Sections

  1. Etheve, M.; Alès, Z.; Bissuel, C.; Kedad-Sidhoum, S. and Juan, O. Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm. In Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pages 176-185, 2020. doi  www 

2019

Conference Articles

  1. Ethève, M.; Alès, Z.; Bissuel, C.; Juan, O. and Kedad-Sidhoum, S. A Graph-based Heuristic for Variable Selection in Mixed Integer Linear Programming. In PGMO Days, Paris, France, 2019. www 
Top