Lucas Létocart

Publication Activity (10 Years)

Years Active: 2003-2022
Publications (10 Years): 16

Top Topics

Vehicle Routing

Top Venues

Electron. Notes Discret. Math.

Comput. Oper. Res.

Publications

Enrico Bettiol, Immanuel M. Bomze, Lucas Létocart, Francesco Rinaldi, Emiliano Traversi
Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems. Comput. Oper. Res. 142 (2022)
Charly Alizadeh, Pegah Alizadeh, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi
How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF. IJCNN (2022)
Alberto Ceselli, Lucas Létocart, Emiliano Traversi
Dantzig-Wolfe reformulations for binary quadratic problems. Math. Program. Comput. 14 (1) (2022)
Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Emiliano Traversi
A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems. CoRR (2021)
Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi
Preface: CTW 2018. Discret. Appl. Math. 296 (2021)
Enrico Bettiol, Lucas Létocart, Francesco Rinaldi, Emiliano Traversi
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs. Comput. Optim. Appl. 75 (2) (2020)
Stefania Pan, Roberto Wolfler Calvo, Mahuna Akplogan, Lucas Létocart, Nora Touati Moungla
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints. Discret. Optim. 33 (2019)
Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Jean Maeght, Emiliano Traversi
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems. CoRR (2019)
Michele Garraffa, Mustapha Bekhti, Lucas Létocart, Nadjib Achir, Khaled Boussetta
Drones path planning for WSN data gathering: A column generation heuristic approach. WCNC (2018)
Stefania Pan, Mahuna Akplogan, Nora Touati Moungla, Lucas Létocart, Roberto Wolfler Calvo, Louis-Martin Rousseau
A hybrid heuristic for the multi-activity tour scheduling problem. Electron. Notes Discret. Math. 69 (2018)
Roberto Wolfler Calvo, Lucas Létocart, Roberto Baldacci
Preface: Emerging challenges in transportation planning. Networks 72 (3) (2018)
Mustapha Bekhti, Michele Garraffa, Nadjib Achir, Khaled Boussetta, Lucas Létocart
Assessment of multi-UAVs tracking for data gathering. IWCMC (2017)
Franck Butelle, Laurent Alfandari, Camille Coti, Lucian Finta, Lucas Létocart, Gérard Plateau, Frédéric Roupin, Antoine Rozenknop, Roberto Wolfler Calvo
Fast machine reassignment. Ann. Oper. Res. 242 (1) (2016)
Paolo Gianessi, Alberto Ceselli, Lucas Létocart, Roberto Wolfler Calvo
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities. Electron. Notes Discret. Math. 55 (2016)
Paolo Gianessi, Laurent Alfandari, Lucas Létocart, Roberto Wolfler Calvo
The Multicommodity-Ring Location Routing Problem. Transp. Sci. 50 (2) (2016)
Lucas Létocart, Angelika Wiegele
Exact Solution Methods for the k-Item Quadratic Knapsack Problem. ISCO (2016)
Marco Casazza, Alberto Ceselli, Lucas Létocart
Optimizing Time Slot Allocation in Single Operator Home Delivery Problems. OR (2014)
Antoine Rozenknop, Roberto Wolfler Calvo, Laurent Alfandari, Daniel Chemla, Lucas Létocart
Solving the electricity production planning problem by a column generation based heuristic. J. Sched. 16 (6) (2013)
Hanane Allaoua, Sylvie Borne, Lucas Létocart, Roberto Wolfler Calvo
A matheuristic approach for solving a home health care problem. Electron. Notes Discret. Math. 41 (2013)
Lucas Létocart, Anass Nagih, Nora Touati Moungla
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. Int. J. Math. Oper. Res. 4 (3) (2012)
Karima Mouhoubi, Lucas Létocart, Céline Rouveirol
A Knowledge-Driven Bi-clustering Method for Mining Noisy Datasets. ICONIP (3) (2012)
Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine
Compact Relaxations for Polynomial Programming Problems. SEA (2012)
Lucas Létocart, Anass Nagih, Gérard Plateau
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. Comput. Oper. Res. 39 (1) (2012)
Karima Mouhoubi, Lucas Létocart, Céline Rouveirol
Heuristique pour l'extraction de motifs ensemblistes bruités. EGC (2011)
Karima Mouhoubi, Lucas Létocart, Céline Rouveirol
Itemset Mining in Noisy Contexts: A Hybrid Approach. ICTAI (2011)
Nicolas Lermé, Lucas Létocart, François Malgouyres
Reduced graphs for min-cut/max-flow approaches in image segmentation. Electron. Notes Discret. Math. 37 (2011)
Nicolas Lermé, François Malgouyres, Lucas Létocart
Reducing graphs in graph cut segmentation. ICIP (2010)
Nora Touati Moungla, Lucas Létocart, Anass Nagih
An improving dynamic programming algorithm to solve the shortest path problem with time windows. Electron. Notes Discret. Math. 36 (2010)
Nora Touati Moungla, Lucas Létocart, Anass Nagih
Solutions diversification in a column generation algorithm. Algorithmic Oper. Res. 5 (2) (2010)
Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
Multicuts and integral multiflows in rings. Eur. J. Oper. Res. 196 (3) (2009)
Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. Eur. J. Oper. Res. 177 (2) (2007)
Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. Oper. Res. Lett. 34 (4) (2006)
Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162 (1) (2005)
Marie-Christine Costa, Lucas Létocart, Frédéric Roupin
A greedy algorithm for multicut and integral multiflow in rooted trees. Oper. Res. Lett. 31 (1) (2003)