Data Approximation by L1 Spline Fits with Free Knots

L1 spline fits are a class of spline models that have shown advantages in approximating irregular and multiscale data. This paper investigates the knot placement problem of L1 spline fits under two scenarios. If the number of knots is given, we propose an augmented Lagrangian method to solve the bilevel L1 spline fit problem and … Read more

A new approximation algorithm for unrelated parallel machine scheduling problem with release dates

In this research, we consider the unrelated parallel machine scheduling problem with release dates. The goal of this scheduling problem is to find an optimal job assignment with minimal sum of weighted completion times. As it is demonstrated in the present paper, this problem is NP-hard in the strong sense. Albeit the computational complexity, which … Read more