Mathieu Lacroix

According to our database, Mathieu Lacroix authored at least 32 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Contractions in perfect graph.

Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix

CoRR, 2024

2023

Hard problems on box-totally dual integral polyhedra.

Patrick Chervet, Roland Grappe, Mathieu Lacroix, Francesco Pisanu, Roberto Wolfler Calvo

Discret. Optim., November, 2023

Box-total dual integrality and edge-connectivity.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini

Math. Program., January, 2023

Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs.

Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier

CoRR, 2023

The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms.

Roland Grappe, Mathieu Lacroix, Sébastien Martin

Proceedings of the 9th International Conference on Control, 2023

2022

The Schrijver system of the flow cone in series-parallel graphs.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini, Roberto Wolfler Calvo

Discret. Appl. Math., 2022

Art Music Composers & Interaction.

Mathieu Lacroix

Proceedings of the Mensch und Computer 2022 - Workshopband, Darmstadt, Germany, September 4, 2022

2021

Efficient formulations for the traveling car renter problem and its quota variant.

Mathieu Lacroix, Yasmín Á. Ríos-Solís, Roberto Wolfler Calvo

Optim. Lett., 2021

2020

On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini

Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019

Trader multiflow and box-TDI systems in series-parallel graphs.

Denis Cornaz, Roland Grappe, Mathieu Lacroix

Discret. Optim., 2019

The vertex k-cut problem.

Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin

Discret. Optim., 2019

Representation Learning and Dynamic Programming for Arc-Hybrid Parsing.

Joseph Le Roux, Antoine Rozenknop, Mathieu Lacroix

Proceedings of the 23rd Conference on Computational Natural Language Learning, 2019

2018

The <i>st</i>-bond polytope on series-parallel graphs.

Roland Grappe, Mathieu Lacroix

RAIRO Oper. Res., 2018

Self-sufficient sets in smartgrids.

J. David, Roland Grappe, Mathieu Lacroix, Emiliano Traversi

Electron. Notes Discret. Math., 2018

Lexicographical polytopes.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Clément Pira

Discret. Appl. Math., 2018

2017

Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence.

Caio Corro, Joseph Le Roux, Mathieu Lacroix

Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, 2017

2016

Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo

Discret. Optim., 2016

A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks.

Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo

Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound.

Caio Corro, Joseph Le Roux, Mathieu Lacroix, Antoine Rozenknop, Roberto Wolfler Calvo

Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, 2016

2015

Circuit and bond polytopes on series-parallel graphs.

Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix, Pierre Pesneau

Discret. Optim., 2015

2014

Robust location transportation problems under uncertain demands.

Virginie Gabrel, Mathieu Lacroix, Cécile Murat, Nabila Remli

Discret. Appl. Math., 2014

Mathematical formulations for the Balanced Vertex k-Separator Problem.

Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin

Proceedings of the International Conference on Control, 2014

2012

On the NP-completeness of the perfect matching free subgraph problem.

Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin, Christophe Picouleau

Theor. Comput. Sci., 2012

Models for the single-vehicle preemptive pickup and delivery problem.

Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub

J. Comb. Optim., 2012

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem.

Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks.

Sylvie Borne, Roland Grappe, Mathieu Lacroix

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem.

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint

RAIRO Oper. Res., 2011

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.

Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin

Comput. Ind. Eng., 2011

2010

Tree based heuristics for the preemptive asymmetric stacker crane problem.

Alain Quilliot, Mathieu Lacroix, Hélène Toussaint, Hervé Kerivin

Electron. Notes Discret. Math., 2010

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets.

Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin

Electron. Notes Discret. Math., 2010

On the complexity of the Eulerian closed walk with precedence path constraints problem.

Hervé Kerivin, Mathieu Lacroix, Ali Ridha Mahjoub

Electron. Notes Discret. Math., 2010

Recourse problem of the 2-stage robust location transportation problem.

Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix

Electron. Notes Discret. Math., 2010