Mathieu Lacroix

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 20

Top Topics

Traveling Salesman

Lagrangian Relaxation

Tree Decomposition

Top Venues

Discret. Optim.

Discret. Appl. Math.

Publications

Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix
Contractions in perfect graph. CoRR (2024)
Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier
Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs. CoRR (2023)
Patrick Chervet, Roland Grappe, Mathieu Lacroix, Francesco Pisanu, Roberto Wolfler Calvo
Hard problems on box-totally dual integral polyhedra. Discret. Optim. 50 (2023)
Roland Grappe, Mathieu Lacroix, Sébastien Martin
The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. CoDIT (2023)
Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini
Box-total dual integrality and edge-connectivity. Math. Program. 197 (1) (2023)
Mathieu Lacroix
Art Music Composers & Interaction. MuC (Workshopband) (2022)
Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini, Roberto Wolfler Calvo
The Schrijver system of the flow cone in series-parallel graphs. Discret. Appl. Math. 308 (2022)
Mathieu Lacroix, Yasmín Á. Ríos-Solís, Roberto Wolfler Calvo
Efficient formulations for the traveling car renter problem and its quota variant. Optim. Lett. 15 (6) (2021)
Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. ISCO (2020)
Joseph Le Roux, Antoine Rozenknop, Mathieu Lacroix
Representation Learning and Dynamic Programming for Arc-Hybrid Parsing. CoNLL (2019)
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
The vertex k-cut problem. Discret. Optim. 31 (2019)
Denis Cornaz, Roland Grappe, Mathieu Lacroix
Trader multiflow and box-TDI systems in series-parallel graphs. Discret. Optim. 31 (2019)
J. David, Roland Grappe, Mathieu Lacroix, Emiliano Traversi
Self-sufficient sets in smartgrids. Electron. Notes Discret. Math. 69 (2018)
Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira
Lexicographical polytopes. Discret. Appl. Math. 240 (2018)
Roland Grappe, Mathieu Lacroix
-bond polytope on series-parallel graphs. RAIRO Oper. Res. 52 (3) (2018)
Caio Corro, Joseph Le Roux, Mathieu Lacroix
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence. EMNLP (2017)
Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. ISCO (2016)
Caio Corro, Joseph Le Roux, Mathieu Lacroix, Antoine Rozenknop, Roberto Wolfler Calvo
Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound. ACL (1) (2016)
Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. Discret. Optim. 21 (2016)
Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau
Circuit and bond polytopes on series-parallel graphs. Discret. Optim. 17 (2015)
Virginie Gabrel, Mathieu Lacroix, Cécile Murat, Nabila Remli
Robust location transportation problems under uncertain demands. Discret. Appl. Math. 164 (2014)
Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT (2014)
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
On the complexity of the Eulerian closed walk with precedence path constraints problem. Theor. Comput. Sci. 439 (2012)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. ISCO (2012)
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23 (2) (2012)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423 (2012)
Sylvie Borne, Roland Grappe, Mathieu Lacroix
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks. ISCO (2012)
Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem. RAIRO Oper. Res. 45 (3) (2011)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. Comput. Ind. Eng. 61 (2) (2011)
Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix
Recourse problem of the 2-stage robust location transportation problem. Electron. Notes Discret. Math. 36 (2010)
Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. Electron. Notes Discret. Math. 36 (2010)
Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub
On the complexity of the Eulerian closed walk with precedence path constraints problem. Electron. Notes Discret. Math. 36 (2010)
Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin
Tree based heuristics for the preemptive asymmetric stacker crane problem. Electron. Notes Discret. Math. 36 (2010)