Network flow interdiction is related to blocking k -braids: the aim is to reduce the maximum s − t flow in a network as much as possible, by removing edges of ...
In particular, we will investigate the weighted blocking problem for four types of combinatorial structures: optimal k-spanning trees, optimal k-arborescences, ...
We consider weighted blocking problems (a.k.a. weighted transversal problems) of the following form. Given a finite set $S$, weights $w:S\to \Rset_+$, and a ...
The algorithm is based on two kinds of low-rank changes to the treatment design matrix X: exchanging a point in the design with a potential treatment point, and ...
In this paper, we define the blocking wordlength pattern of a blocked fractional factorial design by combining the wordlength patterns of treatment-defining ...
We propose a method for constructing optimal block designs for experiments on networks. The response model for a given network interference structure extends ...
Conjoint analysis is one of the most used methods in mapping of consumer preferences. Nowadays consumers are mainly satisfying higher-order needs and therefore ...
This function uses various criteria to block either pre-existing designs or to creates a new blocked design from a candidate list.
Missing: structures. | Show results with:structures.
In general, when two blocks are required there should be an axial block and a factorial block. For three blocks, the factorial block is divided into two blocks ...
Mar 26, 2019 · Blocking can be performed on 1-D, 2-D or 3-D spatial data structures. Some iterative applications can further benefit from blocking over ...