Zobrazeno 1 - 10
of 244
pro vyhledávání: '"De Causmaecker, Patrick"'
We study systems of equations on antichains, together with a way to count the number of solutions. We start with a simple example, generalise and show more applications. One of the results was used in the recent computation of D(9), the others have p
Externí odkaz:
http://arxiv.org/abs/2405.20904
Autor:
Van Hirtum, Lennart, De Causmaecker, Patrick, Goemaere, Jens, Kenter, Tobias, Riebler, Heinrich, Lass, Michael, Plessl, Christian
This preprint makes the claim of having computed the $9^{th}$ Dedekind Number. This was done by building an efficient FPGA Accelerator for the core operation of the process, and parallelizing it on the Noctua 2 Supercluster at Paderborn University. T
Externí odkaz:
http://arxiv.org/abs/2304.03039
Decades of research on the 0-1 knapsack problem led to very efficient algorithms that are able to quickly solve large problem instances to optimality. This prompted researchers to also investigate whether relatively small problem instances exist that
Externí odkaz:
http://arxiv.org/abs/2211.09665
Patient scheduling is a difficult task involving stochastic factors such as the unknown arrival times of patients. Similarly, the scheduling of radiotherapy for cancer treatments needs to handle patients with different urgency levels when allocating
Externí odkaz:
http://arxiv.org/abs/2112.08549
The personnel rostering problem is the problem of finding an optimal way to assign employees to shifts, subject to a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of val
Externí odkaz:
http://arxiv.org/abs/2010.14252
In this article we propose a heuristic algorithm to explore search space trees associated with instances of combinatorial optimization problems. The algorithm is based on Monte Carlo tree search, a popular algorithm in game playing that is used to ex
Externí odkaz:
http://arxiv.org/abs/2010.11523
Predicting and comparing algorithm performance on graph instances is challenging for multiple reasons. First, there is usually no standard set of instances to benchmark performance. Second, using existing graph generators results in a restricted spec
Externí odkaz:
http://arxiv.org/abs/2011.02291
Publikováno v:
In European Journal of Operational Research 16 November 2023 311(1):36-55
This paper proposes a local search algorithm for a specific combinatorial optimisation problem in graph theory: the Hamiltonian Completion Problem (HCP) on undirected graphs. In this problem, the objective is to add as few edges as possible to a give
Externí odkaz:
http://arxiv.org/abs/1904.11337
Publikováno v:
In Applied Soft Computing Journal March 2023 136