From post

Wesen, Wert und Grenzen des Stichprobenverfahrens für die empirische Sozialforschung

. Empirische Sozialforschung, глава 12, Institut zur Förderung öffentlicher Angelegenheiten e.\,V., Frankfurt a.\,M., (1952)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine., , и . STOC, стр. 418-426. ACM, (1996)Heuristic approaches for scheduling jobs and vehicles in a cyclic flexible manufacturing system., , и . ISM, том 180 из Procedia Computer Science, стр. 825-832. Elsevier, (2020)Foreword: Combinatorial optimization for industrial engineering., и . Comput. Ind. Eng., 61 (2): 239-241 (2011)The symmetric quadratic knapsack problem: approximation and scheduling applications., и . 4OR, 10 (2): 111-161 (2012)An efficient fully polynomial approximation scheme for the Subset-Sum Problem., , , и . J. Comput. Syst. Sci., 66 (2): 349-370 (2003)Knapsack problems with position-dependent item weights or profits., , и . Ann. Oper. Res., 326 (1): 137-156 (июля 2023)A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date., и . Theor. Comput. Sci., 369 (1-3): 230-238 (2006)A New Fully Polynomial Approximation Scheme for the Knapsack Problem., и . APPROX, том 1444 из Lecture Notes in Computer Science, стр. 123-134. Springer, (1998)The exact LPT-bound for maximizing the minimum completion time., , и . Oper. Res. Lett., 11 (5): 281-287 (1992)Fast approximation schemes for Boolean programming and scheduling problems related to positive convex Half-Product., и . Eur. J. Oper. Res., 228 (1): 24-32 (2013)