Publications (6)
Pricing Filtering in Dantzig-Wolfe Decomposition
Abdellah Bulaich Mehamdi, Mathieu Lacroix, Sébastien Martin
Column generation is used alongside Dantzig-Wolfe Decomposition, especially for linear programs having a decomposable pricing step requiring to solve numerous independent pricing s…
Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithms
Caio Corro, Mathieu Lacroix, Joseph Le Roux
We propose a novel discriminative model for sequence labeling called Bregman conditional random fields (BCRF). Contrary to standard linear-chain conditional random fields, BCRF all…
Contractions in perfect graph
Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe +1
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph i…
Extended formulations for the maximum weighted co-2-plex problem
Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe +1
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree a…
Bundle Network: a Machine Learning-Based Bundle Method
Francesca Demelas, Joseph Le Roux, Antonio Frangioni +3
This paper presents Bundle Network, a learning-based algorithm inspired by the Bundle Method for convex non-smooth minimization problems. Unlike classical approaches that rely on h…
Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs
Francesco Demelas, Joseph Le Roux, Mathieu Lacroix +1
Lagrangian relaxation stands among the most efficient approaches for solving a Mixed Integer Linear Programs (MILP) with difficult constraints. Given any duals for these constraint…