Lucas Létocart

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