Recourse problem of the 2-stage robust location transportation problem. - Virginie Gabrel; Cécile Murat; Nabila Remli; Mathieu Lacroix 001 (Electron. Notes Discret. Math., 2010)

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin (Electron. Notes Discret. Math., 2010)

Tree based heuristics for the preemptive asymmetric stacker crane problem. - Alain Quilliot; Mathieu Lacroix 001; Hélène Toussaint; Hervé Kerivin (Electron. Notes Discret. Math., 2010)

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin (Comput. Ind. Eng., 2011)

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem. - Hervé Kerivin; Mathieu Lacroix 001; Alain Quilliot; Hélène Toussaint (RAIRO Oper. Res., 2011)

The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks. - Sylvie Borne; Roland Grappe; Mathieu Lacroix 001 (ISCO, 2012)

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin (ISCO, 2012)

Models for the single-vehicle preemptive pickup and delivery problem. - Hervé Kerivin; Mathieu Lacroix 001; Ali Ridha Mahjoub (J. Comb. Optim., 2012)

On the complexity of the Eulerian closed walk with precedence path constraints problem. - Hervé Kerivin; Mathieu Lacroix 001; Ali Ridha Mahjoub (Theor. Comput. Sci., 2012)

On the NP-completeness of the perfect matching free subgraph problem. - Mathieu Lacroix 001; Ali Ridha Mahjoub; Sébastien Martin; Christophe Picouleau (Theor. Comput. Sci., 2012)

Mathematical formulations for the Balanced Vertex k-Separator Problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (CoDIT, 2014)

Robust location transportation problems under uncertain demands. - Virginie Gabrel; Mathieu Lacroix 001; Cécile Murat; Nabila Remli (Discret. Appl. Math., 2014)

Circuit and bond polytopes on series-parallel graphs. - Sylvie Borne; Pierre Fouilhoux; Roland Grappe; Mathieu Lacroix 001; Pierre Pesneau (Discret. Optim., 2015)

Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound. - Caio Corro; Joseph Le Roux; Mathieu Lacroix 001; Antoine Rozenknop; Roberto Wolfler Calvo (ACL (1), 2016)

A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Roberto Wolfler Calvo (ISCO, 2016)

Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Roberto Wolfler Calvo (Discret. Optim., 2016)

Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence. - Caio Corro; Joseph Le Roux; Mathieu Lacroix 001 (EMNLP, 2017)

Lexicographical polytopes. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Clément Pira (Discret. Appl. Math., 2018)

Self-sufficient sets in smartgrids. - J. David; Roland Grappe; Mathieu Lacroix 001; Emiliano Traversi (Electron. Notes Discret. Math., 2018)

The st-bond polytope on series-parallel graphs. - Roland Grappe; Mathieu Lacroix 001 (RAIRO Oper. Res., 2018)

Representation Learning and Dynamic Programming for Arc-Hybrid Parsing. - Joseph Le Roux; Antoine Rozenknop; Mathieu Lacroix 001 (CoNLL, 2019)

The vertex k-cut problem. - Denis Cornaz; Fabio Furini; Mathieu Lacroix 001; Enrico Malaguti; Ali Ridha Mahjoub; Sébastien Martin (Discret. Optim., 2019)

Trader multiflow and box-TDI systems in series-parallel graphs. - Denis Cornaz; Roland Grappe; Mathieu Lacroix 001 (Discret. Optim., 2019)

On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Emiliano Lancini (ISCO, 2020)

Efficient formulations for the traveling car renter problem and its quota variant. - Mathieu Lacroix 001; Yasmín Á. Ríos-Solís; Roberto Wolfler Calvo (Optim. Lett., 2021)

The Schrijver system of the flow cone in series-parallel graphs. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Emiliano Lancini; Roberto Wolfler Calvo (Discret. Appl. Math., 2022)

The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. - Roland Grappe; Mathieu Lacroix 001; Sébastien Martin (CoDIT, 2023)

Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs. - Francesco Demelas; Joseph Le Roux; Mathieu Lacroix 001; Axel Parmentier (CoRR, 2023)

Box-total dual integrality and edge-connectivity. - Michele Barbato; Roland Grappe; Mathieu Lacroix 001; Emiliano Lancini (Math. Program., 2023)

Hard problems on box-totally dual integral polyhedra. - Patrick Chervet; Roland Grappe; Mathieu Lacroix 001; Francesco Pisanu; Roberto Wolfler Calvo (Discret. Optim., 2023)

The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition. - Fan Zhang 016; Jiazheng Wang; Mathieu Lacroix 001; Roberto Wolfler Calvo; Youcef Magnouche; Sébastien Martin (CoDIT, 2024)

Predicting Lagrangian Multipliers for Mixed Integer Linear Programs. - Francesco Demelas; Joseph Le Roux; Mathieu Lacroix 001; Axel Parmentier (ICML, 2024)

Contractions in perfect graph. - Alexandre Dupont-Bouillard; Pierre Fouilhoux; Roland Grappe; Mathieu Lacroix 001 (CoRR, 2024)

Bregman Conditional Random Fields: Sequence Labeling with Parallelizable Inference Algorithms. - Caio Corro; Mathieu Lacroix 001; Joseph Le Roux (ACL (1), 2025)

Pricing filtering in Dantzig-Wolfe decomposition. - Abdellah Bulaich Mehamdi; Mathieu Lacroix 001; Sébastien Martin (Oper. Res. Lett., 2025)