A biobjective method for sample allocation in stratified sampling
From MaRDI portal
Publication:856297
DOI10.1016/j.ejor.2005.11.027zbMath1111.90065OpenAlexW2170995548MaRDI QIDQ856297
Emilio Carrizosa, Dolores Romero Morales
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/107466
integer programmingstratified random samplingbiobjective integer programparametric knapsack problemsample allocation
Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (3)
Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling ⋮ Exact optimal sample allocation: more efficient than Neyman ⋮ Unequal probability sampling from a finite population: a multicriteria approach
Cites Work
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Nonlinear integer programming for optimal allocation in stratified sampling
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A nonlinear knapsack problem
- Bayes and Minimax Procedures in Sampling From Finite and Infinite Populations--I
- Multi‐objective combinatorial optimization problems: A survey
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A biobjective method for sample allocation in stratified sampling