Construction of Polygonal Designs Using Linear Integer Programming
From MaRDI portal
Publication:3015891
DOI10.1080/03610921003672196zbMath1279.62031OpenAlexW1999838155MaRDI QIDQ3015891
Rajender Parsad, Baidya Nath Mandal, Vinod Kumar Gupta
Publication date: 13 July 2011
Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610921003672196
linear integer programmingincomplete block designsbalanced sampling plans excluding adjacent unitspolygonal designsincidence vectors
Sampling theory, sample surveys (62D05) Integer programming (90C10) Statistical block designs (62K10)
Related Items
Cites Work
- Existence of balanced sampling plans avoiding cyclic distances
- Existence of BSAs and cyclic BSAs of block size three
- Some existence and construction results of polygonal designs
- New balanced sampling plans excluding adjacent units
- A family of distance balanced sampling plans
- Partitionable sets and cyclic BSECs with block size four
- Sampling plans excluding contiguous units
- Polygonal designs: Some existence and non-existence results
- Group testing for consecutive positives
- Cyclic BSEC of block size 3
- Polygonal designs with blocks of size \(k\leq10\)
- Generalized polygonal designs with block size \(3\) and \(\lambda =1\)
- Two-dimensional balanced sampling plans excluding adjacent units
- The spectrum of cyclic BSEC with block size three
- The spectrum ofBSA(v, 3, λ; α) with α = 2,3
- IPPS Sampling Plans Excluding Adjacent Units
- On a class of partially balanced incomplete block designs with applications in survey sampling
- A class of partial triple systems with applications in survey sampling
- The spectrum of cyclic BSA(ν, 3, λ; α) with α = 2, 3
