default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLucas Létocart
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i4]Amal Benhamiche, Pierre Fouilhoux, Lucas Létocart, Nancy Perrot, Alexis Schneider:
Complexity of the Virtual Network Embedding with uniform demands. CoRR abs/2501.10154 (2025)- 2024
- [i3]Pierre Fouilhoux, Lucas Létocart, Yue Zhang:
A generic Branch-and-Cut algorithm for bi-objective binary linear programs. CoRR abs/2410.08722 (2024) - 2022
- [j22]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: 105735 (2022) - [j21]Alberto Ceselli, Lucas Létocart, Emiliano Traversi:
Dantzig-Wolfe reformulations for binary quadratic problems. Math. Program. Comput. 14(1): 85-120 (2022) - [c10]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: 1-8 - 2021
- [j20]Fabio Furini, Amélie Lambert, Lucas Létocart, Leo Liberti, Emiliano Traversi:
Preface: CTW 2018. Discret. Appl. Math. 296: 1 (2021) - [i2]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 abs/2103.13648 (2021) - 2020
- [j19]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): 321-360 (2020)
2010 – 2019
- 2019
- [j18]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: 146-168 (2019) - [i1]Julie Sliwak, Miguel F. Anjos, Lucas Létocart, Jean Maeght, Emiliano Traversi:
Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems. CoRR abs/1912.09232 (2019) - 2018
- [j17]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: 333-340 (2018) - [j16]Roberto Wolfler Calvo, Lucas Létocart, Roberto Baldacci:
Preface: Emerging challenges in transportation planning. Networks 72(3): 309-310 (2018) - [c9]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: 1-6 - 2017
- [c8]Mustapha Bekhti, Michele Garraffa, Nadjib Achir, Khaled Boussetta, Lucas Létocart:
Assessment of multi-UAVs tracking for data gathering. IWCMC 2017: 1004-1009 - 2016
- [j15]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): 133-160 (2016) - [j14]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: 93-96 (2016) - [j13]Paolo Gianessi, Laurent Alfandari, Lucas Létocart, Roberto Wolfler Calvo:
The Multicommodity-Ring Location Routing Problem. Transp. Sci. 50(2): 541-558 (2016) - [c7]Lucas Létocart, Angelika Wiegele:
Exact Solution Methods for the k-Item Quadratic Knapsack Problem. ISCO 2016: 166-176 - 2014
- [c6]Marco Casazza, Alberto Ceselli, Lucas Létocart:
Optimizing Time Slot Allocation in Single Operator Home Delivery Problems. OR 2014: 91-97 - 2013
- [j12]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: 471-478 (2013) - [j11]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): 585-604 (2013) - 2012
- [j10]Lucas Létocart, Anass Nagih, Gérard Plateau:
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem. Comput. Oper. Res. 39(1): 12-18 (2012) - [j9]Lucas Létocart, Anass Nagih, Nora Touati Moungla:
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming. Int. J. Math. Oper. Res. 4(3): 247-262 (2012) - [c5]Karima Mouhoubi, Lucas Létocart, Céline Rouveirol:
A Knowledge-Driven Bi-clustering Method for Mining Noisy Datasets. ICONIP (3) 2012: 585-593 - [c4]Sonia Cafieri, Pierre Hansen, Lucas Létocart, Leo Liberti, Frédéric Messine:
Compact Relaxations for Polynomial Programming Problems. SEA 2012: 75-86 - 2011
- [j8]Nicolas Lermé, Lucas Létocart, François Malgouyres:
Reduced graphs for min-cut/max-flow approaches in image segmentation. Electron. Notes Discret. Math. 37: 63-68 (2011) - [c3]Karima Mouhoubi, Lucas Létocart, Céline Rouveirol:
Heuristique pour l'extraction de motifs ensemblistes bruités. EGC 2011: 467-472 - [c2]Karima Mouhoubi, Lucas Létocart, Céline Rouveirol:
Itemset Mining in Noisy Contexts: A Hybrid Approach. ICTAI 2011: 33-40 - 2010
- [j7]Nora Touati Moungla, Lucas Létocart, Anass Nagih:
Solutions diversification in a column generation algorithm. Algorithmic Oper. Res. 5(2): 86-95 (2010) - [j6]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: 931-938 (2010) - [c1]Nicolas Lermé, François Malgouyres, Lucas Létocart:
Reducing graphs in graph cut segmentation. ICIP 2010: 3045-3048
2000 – 2009
- 2009
- [j5]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): 1251-1254 (2009) - 2007
- [j4]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): 1312 (2007) - 2006
- [j3]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): 477 (2006) - 2005
- [j2]Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162(1): 55-69 (2005) - 2003
- [j1]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): 21-27 (2003)
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 2025-02-24 21:32 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:
