Lucas Létocart - Citegraph

Author Info

Name	Affiliation	Papers
LUCAS LÉTOCART	CEDRIC-CNAM, 292 rue St. Martin, 75141 Paris Cedex 03, France	26
Collaborators	Citations	PageRank
37	115	12.37
Referers	Referees	References
280	392	206

Search Limit

100392

Publications (26 rows)

Collaborators (37 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs	0	0.34	2020
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints	0	0.34	2019
A hybrid heuristic for the multi-activity tour scheduling problem.	1	0.36	2018
Preface: Emerging challenges in transportation planning.	0	0.34	2018
The Multicommodity-Ring Location Routing Problem	3	0.37	2016
Fast machine reassignment	0	0.34	2016
Exact Solution Methods for the k-Item Quadratic Knapsack Problem.	0	0.34	2016
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities	0	0.34	2016
Optimizing Time Slot Allocation in Single Operator Home Delivery Problems.	0	0.34	2014
Solving the electricity production planning problem by a column generation based heuristic	5	0.49	2013
A matheuristic approach for solving a home health care problem.	12	0.62	2013
A knowledge-driven bi-clustering method for mining noisy datasets	1	0.35	2012
Compact relaxations for polynomial programming problems	2	0.36	2012
Dantzig-Wolfe and Lagrangian Decompositions in Integer Linear Programming	1	0.35	2012
Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem	7	0.50	2012
Reduced graphs for min-cut/max-flow approaches in image segmentation.	2	0.36	2011
Itemset Mining in Noisy Contexts: A Hybrid Approach	1	0.36	2011
Heuristique pour l'extraction de motifs ensemblistes bruités	1	0.36	2011
Solutions diversification in a column generation algorithm	3	0.44	2010
Reducing graphs in graph cut segmentation	6	0.46	2010
An improving dynamic programming algorithm to solve the shortest path problem with time windows	3	0.42	2010
Multicuts and integral multiflows in rings	5	0.42	2009
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]	0	0.34	2007
Erratum to “A greedy algorithm for multicut and integral multiflow in rooted tress” [Oper. Res. Lett. 31(1) (2003) 21–27]	0	0.34	2006
Minimal multicut and maximal integer multiflow: A survey	54	2.27	2005
A greedy algorithm for multicut and integral multiflow in rooted trees	8	0.85	2003