Search

We study systems of equations on antichains, together with a way to count the number of solutions. We start with two simple examples, generalise and show more applications. One of the results was used in the recent computation of D(9), the others have potential to speed up existing techniques in the future.

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. The resulting value is 286386577668298411128469151667598498812366. This value can be verified in two steps. We have made the data file containing the 490M results available, each of which can be verified separately on CPU, and the whole file sums to our proposed value.

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 are hard for existing solvers and investigate which features characterize their hardness. Previously the authors proposed a new class of hard 0-1 knapsack problem instances and demonstrated that the properties of so-called inclusionwise maximal solutions (IMSs) can be important hardness indicators for this class. In the current paper, we formulate several new computationally challenging problems related to the IMSs of arbitrary 0-1 knapsack problem instances. Based on generalizations of previous work and new structural results about IMSs, we formulate polynomial and pseudopolynomial time algorithms for solving these problems. From this we derive a set of 14 computationally expensive features, which we calculate for two large datasets on a supercomputer in approximately 540 CPU-hours. We show that the proposed features contain important information related to the empirical hardness of a problem instance that was missing in earlier features from the literature by training machine learning models that can accurately predict the empirical hardness of a wide variety of 0-1 knapsack problem instances. Using the instance space analysis methodology, we also show that hard 0-1 knapsack problem instances are clustered together around a relatively dense region of the instance space and several features behave differently in the easy and hard parts of the instance space.

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 resources. High priority patients may arrive at any time, and there must be resources available to accommodate them. A common solution is to reserve a flat percentage of treatment capacity for emergency patients. However, this solution can result in overdue treatments for urgent patients, a failure to fully exploit treatment capacity, and delayed treatments for low-priority patients. This problem is especially severe in large and crowded hospitals. In this paper, we propose a prediction-based approach for online dynamic radiotherapy scheduling that dynamically adapts the present scheduling decision based on each incoming patient and the current allocation of resources. Our approach is based on a regression model trained to recognize the links between patients' arrival patterns, and their ideal waiting time in optimal offline solutions where all future arrivals are known in advance. When our prediction-based approach is compared to flat-reservation policies, it does a better job of preventing overdue treatments for emergency patients, while also maintaining comparable waiting times for the other patients. We also demonstrate how our proposed approach supports explainability and interpretability in scheduling decisions using SHAP values.

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 valid solutions. The problem has received significant attention in the literature and is addressed by a large number of exact and metaheuristic methods. In order to make the complex and costly design of heuristics for the personnel rostering problem automatic, we propose a new method combined Deep Neural Network and Tree Search. By treating schedules as matrices, the neural network can predict the distance between the current solution and the optimal solution. It can select solution strategies by analyzing existing (near-)optimal solutions to personnel rostering problem instances. Combined with branch and bound, the network can give every node a probability which indicates the distance between it and the optimal one, so that a well-informed choice can be made on which branch to choose next and to prune the search tree., Comment: 16 pages, 10 figures, 4 tables

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 explore game trees and represents the state-of-the-art algorithm for a number of games. Several enhancements to Monte Carlo tree search are proposed that make the algorithm more suitable in a combinatorial optimization context. These enhancements exploit the combinatorial structure of the problem and aim to efficiently explore the search space tree by pruning subtrees, using a heuristic simulation policy, reducing the domains of variables by eliminating dominated value assignments and using a beam width. The algorithm was implemented with its components specifically tailored to two combinatorial optimization problems: the quay crane scheduling problem with non-crossing constraints and the 0-1 knapsack problem. For the first problem our algorithm surpasses the state-of-the-art results and several new best solutions are found for a benchmark set of instances. For the second problem our algorithm typically produces near-optimal solutions that are slightly worse than the state-of-the-art results, but it needs only a small fraction of the time to do so. These results indicate that the algorithm is competitive with the state-of-the-art for two entirely different combinatorial optimization problems.

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 spectrum of difficulty and the resulting graphs are usually not diverse enough to draw sound conclusions. That is why recent work proposes a new methodology to generate a diverse set of instances by using an evolutionary algorithm. We can then analyze the resulting graphs and get key insights into which attributes are most related to algorithm performance. We can also fill observed gaps in the instance space in order to generate graphs with previously unseen combinations of features. This methodology is applied to the instance space of the Hamiltonian completion problem using two different solvers, namely the Concorde TSP Solver and a multi-start local search algorithm.

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 given undirected graph in order to obtain a Hamiltonian graph. This problem has mainly been studied in the context of various specific kinds of undirected graphs (e.g. trees, unicyclic graphs and series-parallel graphs). The proposed algorithm, however, concentrates on solving HCP for general undirected graphs. It can be considered to belong to the category of matheuristics, because it integrates an exact linear time solution for trees into a local search algorithm for general graphs. This integration makes use of the close relation between HCP and the minimum path partition problem, which makes the algorithm equally useful for solving the latter problem. Furthermore, a benchmark set of problem instances is constructed for demonstrating the quality of the proposed algorithm. A comparison with state-of-the-art solvers indicates that the proposed algorithm is able to achieve high-quality results.

The Steiner Tree Problem (STP) in graphs is an important problem with various applications in many areas such as design of integrated circuits, evolution theory, networking, etc. In this paper, we propose an algorithm to solve the STP. The algorithm includes a reducer and a solver using Variable Neighborhood Descent (VND), interacting with each other during the search. New constructive heuristics and a vertex score system for intensification purpose are proposed. The algorithm is tested on a set of benchmarks which shows encouraging results.

A set of 23 observations of coronal jet events that occurred in coronal bright points has been analyzed. The focus was on the temporal evolution of the mean brightness before and during coronal jet events. In the absolute majority of the cases either single or recurrent coronal jets were preceded by slight precursor disturbances observed in the mean intensity curves. The key conclusion is that we were able to detect quasi-periodical oscillations with characteristic periods from sub-minute up to 3-4 min values in the bright point brightness which precede the jets. Our basic claim is that along with the conventionally accepted scenario of bright point evolution through new magnetic flux emergence and its reconnection with the initial structure of the bright point and the coronal hole, certain MHD oscillatory and wave-like motions can be excited and these can take an important place in the observed dynamics. These quasi-oscillatory phenomena might play the role of links between different epochs of the coronal jet ignition and evolution. They can be an indication of the MHD wave excitation processes due to the system entropy variations, density variations or shear flows. It is very likely a sharp outflow velocity transverse gradients at the edges between the open and closed field line regions. We suppose that magnetic reconnections can be the source of MHD waves due to impulsive generation or rapid temperature variations, and shear flow driven nonmodel MHD wave evolution (self-heating and/or overreflection mechanisms)., Comment: 9 pages, 3 figures, The Astrophysical Journal Letters, Accepted for publication

The present paper discusses results of a statistical study of the characteristics of coronal hole (CH) rotation in order to find connections to the internal rotation of the Sun. The goal is to measure CH rotation rates and study their distribution over latitude and their area sizes. In addition, the CH rotation rates are compared with the solar photospheric and inner layer rotational profiles. We study coronal holes observed within $\pm 60$ latitude and longitude degrees from the solar disc centre during the time span from the 1 January 2013 to 20 April 2015, which includes the extended peak of solar cycle 24.We used data created by the Spatial Possibilistic Clustering Algorithm (SPoCA), which provides the exact location and characterisation of solar coronal holes using SDO=AIA 193 {\AA} channel images. The CH rotation rates are measured with four-hour cadence data to track variable positions of the CH geometric centre. North-south asymmetry was found in the distribution of coronal holes: about 60 percent were observed in the northern hemisphere and 40 percent were observed in the southern hemisphere. The smallest and largest CHs were present only at high latitudes. The average sidereal rotation rate for 540 examined CHs is $13:86 (\pm 0:05)$ degrees/d. Conclusions. The latitudinal characteristics of CH rotation do not match any known photospheric rotation profile. The CH angular velocities exceed the photospheric angular velocities at latitudes higher than 35-40 degrees. According to our results, the CH rotation profile perfectly coincides with tachocline and the lower layers of convection zone at around 0.71 $R_{\odot}$; this indicates that CHs may be linked to the solar global magnetic field, which originates in the tachocline region., Comment: 8 pages, 8 figures, Accepted for publication in A&A

Finding groups of connected individuals in large graphs with tens of thousands or more nodes has received considerable attention in academic research. In this paper, we analyze three main issues with respect to the recent influx of papers on community detection in (large) graphs, highlight the specific problems with the current research avenues, and propose a first step towards a better approach. First, in spite of the strong interest in community detection, a strong conceptual and theoretical foundation of connectedness in large graphs is missing. Yet, it is crucial to be able to determine the specific feats that we aim to analyze in large networks, to avoid a purely black-or-white view. Second, in literature commonly employed (meta)heuristic frameworks are applied for the large graph problems. Currently, it is, however, unclear whether these techniques are even viable options, and what the added value of the constituting parts is. Additionally, the manner in which different algorithms are compared is also ambiguous. Finally, no analyses of the impact of data parameters on the reported clusters is done. Nonetheless, it would be interesting to evaluate which characteristics lead to which type of communities and what their effect is on computational difficulty.

In this research, we discuss the intermittent traveling salesman problem (ITSP), which extends the traditional traveling salesman problem (TSP) by imposing temperature restrictions on each node. These additional constraints limit the maximum allowable visit time per node, and result in multiple visits for each node which cannot be serviced in a single visit. We discuss three different temperature increase and decrease functions, namely a linear, a quadratic and an exponential function. To solve the problem, we consider three different solution representations as part of a metaheuristic approach. We argue that in case of similar temperature increase and decrease profiles, it is always beneficial to apply a greedy approach, i.e. to process as much as possible given the current node temperature.

The IDP knowledge base system currently uses MiniSAT(ID) as its backend Constraint Programming (CP) solver. A few similar systems have used a Mixed Integer Programming (MIP) solver as backend. However, so far little is known about when the MIP solver is preferable. This paper explores this question. It describes the use of CPLEX as a backend for IDP and reports on experiments comparing both backends., Comment: internal report, 10 pages, 2 figures

We consider a multi-neighborhood local search algorithm with a large number of possible neighborhoods. Each neighborhood is accompanied by a weight value which represents the probability of being chosen at each iteration. These weights are fixed before the algorithm runs, and are considered as parameters of the algorithm. Given a set of instances, off-line tuning of the algorithm's parameters can be done by automated algorithm configuration tools (e.g., SMAC). However, the large number of neighborhoods can make the tuning expensive and difficult even when the number of parameters has been reduced by some intuition. In this work, we propose a systematic method to characterize each neighborhood's behaviours, representing them as a feature vector, and using cluster analysis to form similar groups of neighborhoods. The novelty of our characterization method is the ability of reflecting changes of behaviours according to hardness of different solution quality regions. We show that using neighborhood clusters instead of individual neighborhoods helps to reduce the parameter configuration space without misleading the search of the tuning procedure. Moreover, this method is problem-independent and potentially can be applied in similar contexts., Comment: 13 pages

An antichain of subsets is a set of subsets such that no subset in the antichain is a proper subset of any other subset in the antichain. The Dedekind number counts the total number of antichains of subsets of an n-element set. This paper investigates the interval structure of the lattice of antichains. Several partitioning theorems and counting formulas for the size of intervals are derived., Comment: 31pages

In this paper, we provide all information to participate to the Second International Nurse Rostering Competition (INRC-II). First, we describe the problem formulation, which, differently from INRC-I, is a multi-stage procedure. Second, we illustrate all the necessary infrastructure do be used together with the participant's solver, including the testbed, the file formats, and the validation/simulation tools. Finally, we state the rules of the competition. All update-to-date information about the competition is available at http://mobiz.vives.be/inrc2/.

Properties of intervals in the lattice of antichains of subsets of a universe of finite size are investigated. New objects and quantities in this lattice are defined. Expressions and numerical values are deduced for the number of connected antichains and the number of fully distinguishing antichains. The latter establish a connection with Stirling numbers of the second kind. Decomposition properties of intervals in the lattice of antichains are proven. A new operator allowing partitioning the full lattice in intervals derived from lower dimensional sub-lattices is introduced. Special posets underlying an interval of antichains are defined. The poset allows the derivation of a powerful formula for the size of an interval. This formula allows computing intervals in the six dimensional space. Combinatorial coefficients allowing another decomposition of the full lattice are defined. In some specific cases, related to connected components in graphs, these coefficients can be efficiently computed. This formula allows computing the size of the lattice of order 8 efficiently. This size is the number of Dedekind of order 8, the largest one known so far., Comment: Minor changes, typo's and better abstract, line numbers removed

This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial ordering on this set. We study the inter- vals according to this ordering. We show how intervals of antimonotonic functions, and a fortiori the whole space of antimonotonic functions can be partitioned as disjoint unions of certain classes of intervals. These in- tervals are uniquely determined by antimonotonic functions on smaller sets. This leads to recursive enumeration algorithms and new recursion relations. Using various decompositions, we derive new recursion formu- lae for the number of antimonotonic functions and hence for the number of monotonic functions (i.e. the Dedekind number)., Comment: 15 pages