A greedy algorithm for multicut and integral multiflow in rooted trees. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Oper. Res. Lett., 2003)

Minimal multicut and maximal integer multiflow: A survey. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2005)

Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Oper. Res. Lett., 2006)

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2007)

Multicuts and integral multiflows in rings. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2009)

Reducing graphs in graph cut segmentation. - Nicolas Lermé; François Malgouyres; Lucas Létocart (ICIP, 2010)

Solutions diversification in a column generation algorithm. - Nora Touati Moungla; Lucas Létocart; Anass Nagih (Algorithmic Oper. Res., 2010)

An improving dynamic programming algorithm to solve the shortest path problem with time windows. - Nora Touati Moungla; Lucas Létocart; Anass Nagih (Electron. Notes Discret. Math., 2010)

Heuristique pour l'extraction de motifs ensemblistes bruités. - Karima Mouhoubi; Lucas Létocart; Céline Rouveirol (EGC, 2011)

Itemset Mining in Noisy Contexts: A Hybrid Approach. - Karima Mouhoubi; Lucas Létocart; Céline Rouveirol (ICTAI, 2011)

Reduced graphs for min-cut/max-flow approaches in image segmentation. - Nicolas Lermé; Lucas Létocart; François Malgouyres (Electron. Notes Discret. Math., 2011)

A Knowledge-Driven Bi-clustering Method for Mining Noisy Datasets. - Karima Mouhoubi; Lucas Létocart; Céline Rouveirol (ICONIP (3), 2012)

Compact Relaxations for Polynomial Programming Problems. - Sonia Cafieri; Pierre Hansen; Lucas Létocart; Leo Liberti; Frédéric Messine (SEA, 2012)

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. - Lucas Létocart; Anass Nagih; Gérard Plateau (Comput. Oper. Res., 2012)

Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. - Lucas Létocart; Anass Nagih; Nora Touati Moungla (Int. J. Math. Oper. Res., 2012)

A matheuristic approach for solving a home health care problem. - Hanane Allaoua; Sylvie Borne; Lucas Létocart; Roberto Wolfler Calvo (Electron. Notes Discret. Math., 2013)

Solving the electricity production planning problem by a column generation based heuristic. - Antoine Rozenknop; Roberto Wolfler Calvo; Laurent Alfandari; Daniel Chemla; Lucas Létocart (J. Sched., 2013)

Optimizing Time Slot Allocation in Single Operator Home Delivery Problems. - Marco Casazza; Alberto Ceselli; Lucas Létocart (OR, 2014)

Exact Solution Methods for the k-Item Quadratic Knapsack Problem. - Lucas Létocart; Angelika Wiegele (ISCO, 2016)

Fast machine reassignment. - Franck Butelle; Laurent Alfandari; Camille Coti; Lucian Finta; Lucas Létocart; Gérard Plateau; Frédéric Roupin; Antoine Rozenknop; Roberto Wolfler Calvo (Ann. Oper. Res., 2016)

A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. - Paolo Gianessi; Alberto Ceselli; Lucas Létocart; Roberto Wolfler Calvo (Electron. Notes Discret. Math., 2016)

The Multicommodity-Ring Location Routing Problem. - Paolo Gianessi; Laurent Alfandari; Lucas Létocart; Roberto Wolfler Calvo (Transp. Sci., 2016)

Assessment of multi-UAVs tracking for data gathering. - Mustapha Bekhti; Michele Garraffa; Nadjib Achir; Khaled Boussetta; Lucas Létocart (IWCMC, 2017)

Drones path planning for WSN data gathering: A column generation heuristic approach. - Michele Garraffa; Mustapha Bekhti; Lucas Létocart; Nadjib Achir; Khaled Boussetta (WCNC, 2018)

A hybrid heuristic for the multi-activity tour scheduling problem. - Stefania Pan; Mahuna Akplogan; Nora Touati Moungla; Lucas Létocart; Roberto Wolfler Calvo; Louis-Martin Rousseau (Electron. Notes Discret. Math., 2018)

Preface: Emerging challenges in transportation planning. - Roberto Wolfler Calvo; Lucas Létocart; Roberto Baldacci (Networks, 2018)

Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems. - Julie Sliwak; Miguel F. Anjos; Lucas Létocart; Jean Maeght; Emiliano Traversi (CoRR, 2019)

A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. - Stefania Pan; Roberto Wolfler Calvo; Mahuna Akplogan; Lucas Létocart; Nora Touati Moungla (Discret. Optim., 2019)

A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs. - Enrico Bettiol; Lucas Létocart; Francesco Rinaldi; Emiliano Traversi (Comput. Optim. Appl., 2020)

A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems. - Julie Sliwak; Miguel F. Anjos; Lucas Létocart; Emiliano Traversi (CoRR, 2021)

Preface: CTW 2018. - Fabio Furini; Amélie Lambert; Lucas Létocart; Leo Liberti; Emiliano Traversi (Discret. Appl. Math., 2021)

How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF. - Charly Alizadeh; Pegah Alizadeh; Miguel F. Anjos; Lucas Létocart; Emiliano Traversi (IJCNN, 2022)

Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems. - Enrico Bettiol; Immanuel M. Bomze; Lucas Létocart; Francesco Rinaldi; Emiliano Traversi (Comput. Oper. Res., 2022)

Dantzig-Wolfe reformulations for binary quadratic problems. - Alberto Ceselli; Lucas Létocart; Emiliano Traversi (Math. Program. Comput., 2022)

A generic Branch-and-Cut algorithm for bi-objective binary linear programs. - Pierre Fouilhoux; Lucas Létocart; Yue Zhang (CoRR, 2024)

Complexity of the Virtual Network Embedding with uniform demands. - Amal Benhamiche; Pierre Fouilhoux; Lucas Létocart; Nancy Perrot; Alexis Schneider (CoRR, 2025)