← Search

Olivier Goudet

2 accepted papers

2026

Black-Box Combinatorial Optimization with Order-Invariant Reinforcement Learning

ICML 2026poster

We introduce an order-invariant reinforcement learning framework for black-box combinatorial optimization. Classical estimation-of-distribution algorithms (EDAs) often rely on learning explicit variable dependency graphs, which can be costly and fail to capture complex interactions efficiently. In c…

Cited by 0SourceScholar
2023

New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem

IJCAI 2023poster

This paper addresses the weighted vertex coloring problem (WVCP) which is an NP-hard variant of the graph coloring problem with various applications. Given a vertex-weighted graph, the problem consists of partitioning vertices in independent sets (colors) so as to minimize the sum of the maximum we…