31 citations · 40 across the 10 of their papers we have counts for
10 papers
Fast SDP certification of neural networks : towards large multi-class datasets
Margot Boyer, Clément Rambour, Zacharie Alès +1
We present a new quadratic model for the certification problem in adversarial robustness, which simultaneously accounts for all possible target classes. Building on this model, we…
Planning in Branch-and-Bound: Model-Based Reinforcement Learning for Exact Combinatorial Optimization
Paul Strang, Zacharie Alès, Côme Bissuel +3
Mixed-Integer Linear Programming (MILP) lies at the core of many real-world combinatorial optimization (CO) problems, traditionally solved by branch-and-bound (B&B). A key driver i…
A Markov Decision Process for Variable Selection in Branch & Bound
Paul Strang, Zacharie Alès, Côme Bissuel +3
Mixed-Integer Linear Programming (MILP) is a powerful framework used to address a wide range of NP-hard combinatorial optimization problems, often solved by Branch and Bound (B&B).…
Influence branching for learning to solve mixed-integer programs online
Paul Strang, Zacharie Alès, Côme Bissuel +3
On the occasion of the 20th Mixed Integer Program Workshop's computational competition, this work introduces a new approach for learning to solve MIPs online. Influence branching,…
A rounding and clustering-based exact algorithm for the p-center problem
Zacharie Ales, Cristian Duran-Matelunaa, Sourour Elloumi
The p-center problem consists in selecting p facilities from a set of possible sites and allocating a set of clients to them in such a way that the maximum distance between a clien…
Compact MILP formulations for the -center problem
Zacharie Ales, Sourour Elloumi
The p-center problem consists in selecting p centers among M to cover N clients, such that the maximal distance between a client and its closest selected center is minimized. For t…
An efficient Benders decomposition for the p-median problem
Cristian Durán Mateluna, Zacharie Alès, Sourour Elloumi
The p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its neare…
A solution robustness approach applied to network optimization problems
Zacharie Ales, Sourour Elloumi
Solution robustness focuses on structural similarities between the nominal solution and the scenario solutions. Most other robust optimization approaches focus on the quality robus…
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Marc Etheve, Zacharie Alès, Côme Bissuel +2
Mixed integer linear programs are commonly solved by Branch and Bound algorithms. A key factor of the efficiency of the most successful commercial solvers is their fine-tuned heuri…
On the polyhedron of the K-partitioning problem with representative variables
Zacharie Ales, Arnaud Knippel, Alexandre Pauchet
The K-partitioning problem consists of partitioning the vertices of a graph in K sets so as to minimize a function of the edge weights. We introduce a linear mixed integer formulat…