default search action
Mathieu Lacroix
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Zhang Fan, Jiazheng Wang, Mathieu Lacroix, Roberto Wolfler Calvo, Youcef Magnouche, Sébastien Martin:
The Multi-commodity Flow Problem: Double Dantzig-Wolfe decomposition. CoDIT 2024: 1171-1176 - [c11]Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier:
Predicting Lagrangian Multipliers for Mixed Integer Linear Programs. ICML 2024 - [i2]Alexandre Dupont-Bouillard, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix:
Contractions in perfect graph. CoRR abs/2401.12793 (2024) - 2023
- [j21]Patrick Chervet, Roland Grappe
, Mathieu Lacroix
Hard problems on box-totally dual integral polyhedra. Discret. Optim. 50: 100810 (2023) - [j20]Michele Barbato
Box-total dual integrality and edge-connectivity. Math. Program. 197(1): 307-336 (2023) - [c10]Roland Grappe
The Multiple Pairs Shortest Path Problem for Sparse Graphs: Exact Algorithms. CoDIT 2023: 956-961 - [i1]Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier:
Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs. CoRR abs/2310.14659 (2023) - 2022
- [j19]Michele Barbato
The Schrijver system of the flow cone in series-parallel graphs. Discret. Appl. Math. 308: 162-167 (2022) - [c9]Mathieu Lacroix:
Art Music Composers & Interaction. MuC (Workshopband) 2022 - 2021
- [j18]Mathieu Lacroix
Efficient formulations for the traveling car renter problem and its quota variant. Optim. Lett. 15(6): 1905-1930 (2021) - 2020
- [c8]Michele Barbato
On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. ISCO 2020: 27-41
2010 – 2019
- 2019
- [j17]Denis Cornaz, Fabio Furini
The vertex k-cut problem. Discret. Optim. 31: 8-28 (2019) - [j16]Denis Cornaz, Roland Grappe, Mathieu Lacroix
Trader multiflow and box-TDI systems in series-parallel graphs. Discret. Optim. 31: 103-114 (2019) - [c7]Joseph Le Roux, Antoine Rozenknop, Mathieu Lacroix
Representation Learning and Dynamic Programming for Arc-Hybrid Parsing. CoNLL 2019: 238-248 - 2018
- [j15]Michele Barbato
Lexicographical polytopes. Discret. Appl. Math. 240: 3-7 (2018) - [j14]J. David, Roland Grappe, Mathieu Lacroix, Emiliano Traversi
Self-sufficient sets in smartgrids. Electron. Notes Discret. Math. 69: 301-308 (2018) - [j13]Roland Grappe
The st-bond polytope on series-parallel graphs. RAIRO Oper. Res. 52(3): 923-934 (2018) - 2017
- [c6]Caio Corro, Joseph Le Roux, Mathieu Lacroix
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence. EMNLP 2017: 1644-1654 - 2016
- [j12]Michele Barbato
Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks. Discret. Optim. 21: 25-41 (2016) - [c5]Caio Corro, Joseph Le Roux, Mathieu Lacroix
Dependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound. ACL (1) 2016 - [c4]Michele Barbato
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. ISCO 2016: 260-272 - 2015
- [j11]Sylvie Borne, Pierre Fouilhoux, Roland Grappe, Mathieu Lacroix
Circuit and bond polytopes on series-parallel graphs. Discret. Optim. 17: 55-68 (2015) - 2014
- [j10]Virginie Gabrel, Mathieu Lacroix
Robust location transportation problems under uncertain demands. Discret. Appl. Math. 164: 100-111 (2014) - [c3]Denis Cornaz, Fabio Furini
Mathematical formulations for the Balanced Vertex k-Separator Problem. CoDIT 2014: 176-181 - 2012
- [j9]Hervé Kerivin, Mathieu Lacroix
Models for the single-vehicle preemptive pickup and delivery problem. J. Comb. Optim. 23(2): 196-223 (2012) - [j8]Mathieu Lacroix
On the NP-completeness of the perfect matching free subgraph problem. Theor. Comput. Sci. 423: 25-29 (2012) - [j7]Hervé Kerivin, Mathieu Lacroix
On the complexity of the Eulerian closed walk with precedence path constraints problem. Theor. Comput. Sci. 439: 16-29 (2012) - [c2]Sylvie Borne, Roland Grappe, Mathieu Lacroix
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks. ISCO 2012: 105-116 - [c1]Mathieu Lacroix
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. ISCO 2012: 117-128 - 2011
- [j6]Mathieu Lacroix
Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. Comput. Ind. Eng. 61(2): 422-429 (2011) - [j5]Hervé Kerivin, Mathieu Lacroix
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem. RAIRO Oper. Res. 45(3): 179-207 (2011) - 2010
- [j4]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: 41-48 (2010) - [j3]Virginie Gabrel, Cécile Murat, Nabila Remli, Mathieu Lacroix
Recourse problem of the 2-stage robust location transportation problem. Electron. Notes Discret. Math. 36: 167-174 (2010) - [j2]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: 899-906 (2010) - [j1]Mathieu Lacroix
Structural Analysis for Differential-Algebraic Systems: Complexity, Formulation and Facets. Electron. Notes Discret. Math. 36: 1073-1080 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: