Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Libralesso, Luc"'
Autor:
Crombez, Loïc, da Fonseca, Guilherme D., Fontan, Florian, Gerard, Yan, Gonzalez-Lorenzo, Aldo, Lafourcade, Pascal, Libralesso, Luc, Momège, Benjamin, Spalding-Jamieson, Jack, Zhang, Brandon, Zheng, Da Wei
CG:SHOP is an annual geometric optimization challenge and the 2022 edition proposed the problem of coloring a certain geometric graph defined by line segments. Surprisingly, the top three teams used the same technique, called conflict optimization. T
Externí odkaz:
http://arxiv.org/abs/2303.09632
Autor:
Crombez, Loïc, da Fonseca, Guilherme D., Gerard, Yan, Gonzalez-Lorenzo, Aldo, Lafourcade, Pascal, Libralesso, Luc
Publikováno v:
ACM Journal of Experimental Algorithmics, 27, 3.2, 1-17, 2022
This paper describes the heuristics used by the Shadoks team for the CG:SHOP 2021 challenge. This year's problem is to coordinate the motion of multiple robots in order to reach their targets without collisions and minimizing the makespan. It is a cl
Externí odkaz:
http://arxiv.org/abs/2103.13956
We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branch-and-bounds and a guidance strategy inspired by the LR heuristic. It
Externí odkaz:
http://arxiv.org/abs/2009.05800
Autor:
Libralesso, Luc, Fontan, Florian
In this article, we present the anytime tree search algorithm we designed for the 2018 ROADEF/EURO challenge glass cutting problem proposed by the French company Saint-Gobain. The resulting program was ranked first among 64 participants. Its key comp
Externí odkaz:
http://arxiv.org/abs/2004.00963
Autor:
Fontan, Florian, Libralesso, Luc
[libralesso_anytime_2020] proposed an anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (https://www.roadef.org/challenge/2018/en/index.php). The resulting program was ranked first among 64 participants. In this a
Externí odkaz:
http://arxiv.org/abs/2004.02603
We present a study of several generic tree search techniques applied to the Sequential Ordering Problem. This study enables us to propose a simple and competitive tree search algorithm. It consists of an iterative Beam Search algorithm that favors se
Externí odkaz:
http://arxiv.org/abs/1911.12427
Publikováno v:
In European Journal of Operational Research 16 August 2022 301(1):217-234
Publikováno v:
In Information and Computation May 2022 285 Part B
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hadj Salem, Khadija1 (AUTHOR) khadija.hadj-salem@univ-tours.fr, Libralesso, Luc2 (AUTHOR), Jost, Vincent2 (AUTHOR), Fontan, Florian2 (AUTHOR), Maffray, Frédéric2 (AUTHOR)
Publikováno v:
Annals of Operations Research. Jun2024, Vol. 337 Issue 2, p715-730. 16p.