In many fields, we come across problems where we want to optimize several conflicting objectives simultaneously. To find a good solution for such multi-objective optimization problems, an approximation of the Pareto set is often generated. In this paper, we consider the approximation of Pareto...

Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem...

We investigate minimax Latin hypercube designs in two dimensions for several distance measures. For the l-distance we are able to construct minimax Latin hypercube designs of n points, and to determine the minimal covering radius, for all n. For the l1-distance we have a lower bound for the...

In black box evaluation and optimization, Latin hypercube designs play an important role. When dealing with multiple black box functions, the need often arises to construct designs for all black boxes jointly, instead of individually. These so-called nested designs consist of two different...

The problem of finding a maximin Latin hypercube design in two dimensions can be described as positioning n non-attacking rooks on an n x n chessboard such that the minimal distance between pairs of rooks is maximized. Maximin Latin hypercube designs are important for the approximation and...

The design of computer experiments is an important step in black box evaluation and optimization processes. When dealing with multiple black box functions the need often arises to construct designs for all black boxes jointly, instead of individually. These so-called nested designs are used to...

In this and a sequel paper, we study combinatorial designs whose incidence matrix has two distinct singular values. These generalize 2-(v, k, lambda) designs, and include partial geometric designs and uniform multiplicative designs. Here, we study the latter, which are precisely the nonsingular...

In this and an earlier paper [17], we study combinatorial designs whose incidence matrix has two distinct singular values. These generalize (v, k, lambda) designs, and include uniform multiplicative designs and partial geometric designs. Here, we study the latter, which are precisely the designs...

We study graphs with spectral radius at most $\frac{3}{2}\sqrt{2}$ and refine results by Woo and Neumaier [On graphs whose spectral radius is bounded by $\frac{3}{2}\sqrt{2}$, Graphs Combinatorics 23 (2007), 713-726]. We study the limit points of the spectral radii of certain families of graphs,...