The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...

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