Följ
Luc Libralesso
Luc Libralesso
Clermont Auvergne University
Verifierad e-postadress på uca.fr - Startsida
Titel
Citeras av
Citeras av
År
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle
L Robert, D Miyahara, P Lafourcade, L Libralesso, T Mizuki
Information and Computation 285, 104858, 2022
282022
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
L Libralesso, F Fontan
European journal of operational research 291 (3), 883-893, 2021
252021
Shadoks approach to low-makespan coordinated motion planning
L Crombez, GD da Fonseca, Y Gerard, A Gonzalez-Lorenzo, ...
ACM Journal of Experimental Algorithmics (JEA) 27, 1-17, 2022
172022
Automatic generation of declarative models for differential cryptanalysis
L Libralesso, F Delobel, P Lafourcade, C Solnon
CP 2021-27th International Conference on Principles and Practice of …, 2021
152021
Iterative beam search algorithms for the permutation flowshop
L Libralesso, PA Focke, A Secardin, V Jost
European Journal of Operational Research 301 (1), 217-234, 2022
122022
Tree search for the sequential ordering problem
L Libralesso, AM Bouhassoun, H Cambazard, V Jost
ECAI 2020, 2020
102020
Local search with weighting schemes for the CG: SHOP 2022 competition
F Fontan, P Lafourcade, L Libralesso, B Momčge
38th International Symposium on Computational Geometry, SoCG, 2022
72022
Deposition chamber technology as building blocks for a standardized brain-on-chip framework
BGC Maisonneuve, L Libralesso, L Miny, A Batut, J Rontard, M Gleyzes, ...
Microsystems & Nanoengineering 8 (1), 86, 2022
62022
PackingSolver: a tree search-based solver for two-dimensional two-and three-staged guillotine packing problems
F Fontan, L Libralesso
URL: https://hal. archives-ouvertes. fr/hal-02531031. working paper or preprint, 2020
62020
Do balanced words have a short period?
N Brauner, Y Crama, E Delaporte, V Jost, L Libralesso
Theoretical Computer Science 793, 169-180, 2019
42019
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
L Crombez, GD Da Fonseca, F Fontan, Y Gerard, A Gonzalez-Lorenzo, ...
ACM Journal of Experimental Algorithmics 28, 1-13, 2023
32023
Mixed Integer Programming formulations for the balanced Traveling Salesman Problem with a lexicographic objective
L Libralesso
Metaheuristics for Combinatorial Optimization, 1-15, 2021
32021
An anytime tree search algorithm for two-dimensional two-and three-staged guillotine packing problems
F Fontan, L Libralesso
arXiv preprint arXiv:2004.02603, 2020
32020
PackingSolver: a solver for Packing Problems
F Fontan, L Libralesso
arXiv preprint arXiv:2004.02603, 2020
32020
Tree search algorithms for the Sequential Ordering Problem
L Libralesso, AM Bouhassoun, H Cambazard, V Jost
arXiv preprint arXiv:1911.12427, 2019
32019
Anytime tree search for combinatorial optimization
L Libralesso
Université Grenoble Alpes [2020-....], 2020
22020
Longest common subsequence: an algorithmic component analysis
L Libralesso, A Secardin, V Jost
12020
Study on partial flexible job-shop scheduling problem under tooling constraints: complexity and related problems
L Libralesso, V Jost, KH Salem, F Fontan, F Maffray
12019
Créer des cerveaux grâce ā la recherche opérationnelle?
L Libralesso, T Honegger, V Jost, F Maffray
12018
Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization
K Hadj Salem, L Libralesso, V Jost, F Fontan, F Maffray
Annals of Operations Research, 1-16, 2024
2024
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20