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...

In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph. In particular, the usual adjacency...

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 determine a lower bound for the spectral radius of a graph in terms of the number of vertices and the diameter of the graph. For the specific case of graphs with diameter three we give a slightly better bound. We also construct families of graphs with small spectral radius, thus obtaining...

We give an overview of results on amorphic association schemes. We give the known constructions of such association schemes, and enumerate most such association schemes on up to 49 vertices. Special attention is paid to cyclotomic association schemes. We give several results on when a strongly...

We show that the Hamming graph H(3; q) with diameter three is uniquely determined by its spectrum for q is greater than or equal to 36. Moreover, we show that for given integer D greater than or equal to 2, any graph cospectral with the Hamming graph H(D, q) is locally the disjoint union of D...

Inspired by some intriguing examples, we study uniform association schemes and uniform coherent configurations. Perhaps the most important subclass of these objects is the class of cometric Q-antipodal association schemes. The concept of a cometric association scheme (the dual version of a...

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...