Lucas Létocart

Orcid: 0000-0002-4919-9036

According to our database1, Lucas Létocart authored at least 34 papers between 2003 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Dantzig-Wolfe reformulations for binary quadratic problems.
Math. Program. Comput., 2022

Mining for diamonds - Matrix generation algorithms for binary quadratically constrained quadratic problems.
Comput. Oper. Res., 2022

How to Learn the Optimal Clique Decompositions in Solving Semidefinite Relaxations for OPF.
Proceedings of the International Joint Conference on Neural Networks, 2022

2021
Preface: CTW 2018.
Discret. Appl. Math., 2021

A Semidefinite Optimization-based Branch-and-Bound Algorithm for Several Reactive Optimal Power Flow Problems.
CoRR, 2021

2020
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs.
Comput. Optim. Appl., 2020

2019
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.
Discret. Optim., 2019

Improving Clique Decompositions of Semidefinite Relaxations for Optimal Power Flow Problems.
CoRR, 2019

2018
Preface: Emerging challenges in transportation planning.
Networks, 2018

A hybrid heuristic for the multi-activity tour scheduling problem.
Electron. Notes Discret. Math., 2018

Drones path planning for WSN data gathering: A column generation heuristic approach.
Proceedings of the 2018 IEEE Wireless Communications and Networking Conference, 2018

2017
Assessment of multi-UAVs tracking for data gathering.
Proceedings of the 13th International Wireless Communications and Mobile Computing Conference, 2017

2016
The Multicommodity-Ring Location Routing Problem.
Transp. Sci., 2016

A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities.
Electron. Notes Discret. Math., 2016

Fast machine reassignment.
Ann. Oper. Res., 2016

Exact Solution Methods for the k-Item Quadratic Knapsack Problem.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2014
Optimizing Time Slot Allocation in Single Operator Home Delivery Problems.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Solving the electricity production planning problem by a column generation based heuristic.
J. Sched., 2013

A matheuristic approach for solving a home health care problem.
Electron. Notes Discret. Math., 2013

2012
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming.
Int. J. Math. Oper. Res., 2012

Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem.
Comput. Oper. Res., 2012

Compact Relaxations for Polynomial Programming Problems.
Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

A Knowledge-Driven Bi-clustering Method for Mining Noisy Datasets.
Proceedings of the Neural Information Processing - 19th International Conference, 2012

2011
Reduced graphs for min-cut/max-flow approaches in image segmentation.
Electron. Notes Discret. Math., 2011

Itemset Mining in Noisy Contexts: A Hybrid Approach.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

Heuristique pour l'extraction de motifs ensemblistes bruités.
Proceedings of the Extraction et gestion des connaissances (EGC'2011), 2011

2010
An improving dynamic programming algorithm to solve the shortest path problem with time windows.
Electron. Notes Discret. Math., 2010

Solutions diversification in a column generation algorithm.
Algorithmic Oper. Res., 2010

Reducing graphs in graph cut segmentation.
Proceedings of the International Conference on Image Processing, 2010

2009
Multicuts and integral multiflows in rings.
Eur. J. Oper. Res., 2009

2007
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69].
Eur. J. Oper. Res., 2007

2006
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27].
Oper. Res. Lett., 2006

2005
Minimal multicut and maximal integer multiflow: A survey.
Eur. J. Oper. Res., 2005

2003
A greedy algorithm for multicut and integral multiflow in rooted trees.
Oper. Res. Lett., 2003


  Loading...