scientific article; zbMATH DE number 3522990

Cited in

(33)

Optimal chemical balance weighing designs for \(v+1\) objects.
\(A\)-optimal chemical balance weighing design with correlated errors
A-optimal chemical balance weighing design with nonhomogeneity of variances of errors
On certain D-optimal spring balance weighing designs
Optimal weighing designs and some new weighing matrices
Optimum Biased Spring Balance Weighing Designs Under Equal Correlations of Errors
Robustness of optimal chemical balance weighing designs for estimation of total weight
Optimum biased spring balance weighing designs
Some new orthogonal designs in linear regression models
Use of balanced bipartite weighing designs as chemical balance designs
A-optimal biased spring balance weighing design
Robustness optimal spring balance weighing designs for estimation total weight
Further orthogonal designs in linear models and sequences with zero autocorrelation
Weighing experiments with \(n\equiv\)2(mod 4) observations.
D-optimal statistical designs with restricted string property
Orthogonal \(2^ k\) and \(3^ k\) factorial designs constructed using sequences with zero autocorrelation
Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
Optimal statistical designs with circular string property
A note on D-optimal chemical balance weighing designs with autocorrelated observations
D-optimal chemical balance weighing designs with autoregressive errors
Optimum spring balance weighing designs for estimating the total weight
Weighing matrices and their applications
A note on the estimation of total weight in chemical balance weighing designs
Constructions of optimum biased spring balance weighing designs with the diagonal covariance matrix of errors
Singular weighing designs and estimation of total weight
Optimum biased spring balance weighing designs with non-homogeneity of the variances of errors
Recent developments in D-optimal designs
On the E- and MV-optimality of spring balance designs with string property
On the complexity of some basic problems in computational convexity. I. Containment problems
A note on D-optimal designs for models with and without an intercept
New weighing matrices via partitioned group actions
Recent accomplishments in weighing designs
Regular D-optimal spring balance weighing designs with correlated errors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4101295)