Mathieu Lacroix

According to our database1, Mathieu Lacroix authored at least 24 papers between 2010 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020

2019
Trader multiflow and box-TDI systems in series-parallel graphs.
Discret. Optim., 2019

The vertex k-cut problem.
Discret. Optim., 2019

Representation Learning and Dynamic Programming for Arc-Hybrid Parsing.
Proceedings of the 23rd Conference on Computational Natural Language Learning, 2019

2018
The <i>st</i>-bond polytope on series-parallel graphs.
RAIRO Oper. Res., 2018

Self-sufficient sets in smartgrids.
Electron. Notes Discret. Math., 2018

Lexicographical polytopes.
Discret. Appl. Math., 2018

2017
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence.
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.
Discret. Optim., 2016

A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks.
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.
Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, 2016

2015
Circuit and bond polytopes on series-parallel graphs.
Discret. Optim., 2015

2014
Robust location transportation problems under uncertain demands.
Discret. Appl. Math., 2014

Mathematical formulations for the Balanced Vertex k-Separator Problem.
Proceedings of the International Conference on Control, 2014

2012
On the NP-completeness of the perfect matching free subgraph problem.
Theor. Comput. Sci., 2012

Models for the single-vehicle preemptive pickup and delivery problem.
J. Comb. Optim., 2012

Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem.
RAIRO Oper. Res., 2011

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.
Comput. Ind. Eng., 2011

2010
Tree based heuristics for the preemptive asymmetric stacker crane problem.
Electron. Notes Discret. Math., 2010

Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets.
Electron. Notes Discret. Math., 2010

On the complexity of the Eulerian closed walk with precedence path constraints problem.
Electron. Notes Discret. Math., 2010

Recourse problem of the 2-stage robust location transportation problem.
Electron. Notes Discret. Math., 2010


  Loading...