Følg
Lucas Létocart
Lucas Létocart
Université Sorbonne Paris Nord
Verifisert e-postadresse på lipn.univ-paris13.fr - Startside
Tittel
Sitert av
Sitert av
År
Minimal multicut and maximal integer multiflow: a survey
MC Costa, L Létocart, F Roupin
European Journal of Operational Research 162 (1), 55-69, 2005
1592005
A matheuristic approach for solving a home health care problem
H Allaoua, S Borne, L Létocart, RW Calvo
Electronic Notes in Discrete Mathematics 41, 471-478, 2013
1312013
The multicommodity-ring location routing problem
P Gianessi, L Alfandari, L Létocart, R Wolfler Calvo
Transportation Science 50 (2), 541-558, 2016
512016
Solving the electricity production planning problem by a column generation based heuristic
A Rozenknop, R Wolfler Calvo, L Alfandari, D Chemla, L Létocart
Journal of Scheduling 16, 585-604, 2013
332013
Reoptimization in Lagrangian methods for the 0–1 quadratic knapsack problem
L Létocart, A Nagih, G Plateau
Computers & operations research 39 (1), 12-18, 2012
312012
Reducing graphs in graph cut segmentation
N Lermé, F Malgouyres, L Létocart
2010 IEEE International Conference on Image Processing, 3045-3048, 2010
292010
A greedy algorithm for multicut and integral multiflow in rooted trees
MC Costa, L Létocart, F Roupin
Operations Research Letters 31 (1), 21-27, 2003
282003
Solutions diversification in a column generation algorithm
N Touati, L Létocart, A Nagih
Algorithmic Operations Research 5 (2), 86-95, 2010
262010
Drones path planning for WSN data gathering: A column generation heuristic approach
M Garraffa, M Bekhti, L Létocart, N Achir, K Boussetta
2018 IEEE Wireless Communications and Networking Conference (WCNC), 1-6, 2018
232018
An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem
L Létocart, MC Plateau, G Plateau
Pesquisa Operacional 34, 49-72, 2014
212014
Dantzig-Wolfe and Lagrangian decompositions in integer linear programming
L Létocart, A Nagih, N Touati-Moungla
International Journal of Mathematics in Operational Research 4 (3), 247-262, 2012
122012
A clique merging algorithm to solve semidefinite relaxations of optimal power flow problems
J Sliwak, ED Andersen, MF Anjos, L Létocart, E Traversi
IEEE Transactions on Power Systems 36 (2), 1641-1644, 2020
112020
Multicuts and integral multiflows in rings
C Bentz, MC Costa, L Létocart, F Roupin
European Journal of Operational Research 196 (3), 1251-1254, 2009
112009
A column generation based heuristic for the multicommodity-ring vehicle routing problem
P Gianessi, L Alfandari, L Létocart, RW Calvo
Transportation Research Procedia 12, 227-238, 2016
102016
Le système UNIX
S Borne, L Létocart, M Barbato
101985
An improving dynamic programming algorithm to solve the shortest path problem with time windows
NT Moungla, L Létocart, A Nagih
Electronic Notes in Discrete Mathematics 36, 931-938, 2010
92010
A hybrid heuristic for the multi-activity tour scheduling problem
S Pan, M Akplogan, N Touati, L Létocart, RW Calvo, LM Rousseau
Electronic Notes in Discrete Mathematics 69, 333-340, 2018
82018
Fast machine reassignment
F Butelle, L Alfandari, C Coti, L Finta, L Létocart, G Plateau, F Roupin, ...
Annals of Operations Research 242, 133-160, 2016
82016
Reduced graphs for min-cut/max-flow approaches in image segmentation
N Lermé, L Létocart, F Malgouyres
Electronic Notes in Discrete Mathematics 37, 63-68, 2011
82011
Improving clique decompositions of semidefinite relaxations for optimal power flow problems
J Sliwak, M Anjos, L Létocart, J Maeght, E Traversi
arXiv preprint arXiv:1912.09232, 2019
72019
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20