Four NP-hard optimization problems on graphs are studied: The vertex separator problem, the edge separator problem, the maximum clique problem, and the maximum independent set problem. We show that the vertex separator problem is equivalent to a continuous bilinear quadratic program. This...

Assigning tasks to work stations is an essential problem which needs to be addressed in an assembly line design. The most basic model is called simple assembly line balancing problem type 1 (SALBP-1). We provide a survey on 12 heuristics and 9 lower bounds for this model and test them on a...

We propose tree and random forest methods for non-homogeneous Poisson processes. The splitting criterion is derived from a model with a piecewise constant rate function. A simulation study shows that the new method performs well.

Recent research has shown great interest in statistical inference methods for community detection, not only in models and algorithms but also in the detectability. In this paper we propose a fast community detection algorithm based on the degree-corrected block model. By introducing a parameter...

Four years of soybean experimental data observed at Daxing, North China Plain, were used to assess the ability of the AquaCrop model to predict soybean final biomass and yield. The model was parameterized and calibrated using field data on leaf area index (LAI), available soil water, soil...

A tree-based algorithm for longitudinal regression analysis that aims to learn whether and how the effects of predictor variables depend on moderating variables is presented. The algorithm is based on multivariate generalized linear mixed models and it builds piecewise constant coefficient...