摘要: We show how to find mixing probabilities, or weights, for composite probability mass functions (pmfs) k-variate discrete random variables with specified marginal pmfs and a specified, feasible population correlation structure. characterize joint pmf that is composition, mixture, of 2/sup k-1/ extreme the under independence. Our composition method also valid multivariate continuous variables. consider cases where all distributions are uniform, negative exponential, uniform.
acm.org
sci-hub.st 参考文章(12)
Russell A. Rushmeier, George L. Nemhauser, Experiments with parallel branch-and-bound algorithms for the set covering problem Operations Research Letters. ,vol. 13, pp. 277- 285 ,(1993) , 10.1016/0167-6377(93)90050-Q
Thuruthickara C. John, Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty Computers & Operations Research. ,vol. 16, pp. 471- 479 ,(1989) , 10.1016/0305-0548(89)90034-8
Silvano Martello, Paolo Toth, A New Algorithm for the 0-1 Knapsack Problem Management Science. ,vol. 34, pp. 633- 644 ,(1988) , 10.1287/MNSC.34.5.633
Ronald L. Iman, W. J. Conover, A distribution-free approach to inducing rank correlation among input variables Communications in Statistics - Simulation and Computation. ,vol. 11, pp. 311- 334 ,(1982) , 10.1080/03610918208812265
Ward Whitt, Bivariate Distributions with Given Marginals Annals of Statistics. ,vol. 4, pp. 1280- 1289 ,(1976) , 10.1214/AOS/1176343660
Egon Balas, Eitan Zemel, An Algorithm for Large Zero-One Knapsack Problems Operations Research. ,vol. 28, pp. 1130- 1154 ,(1980) , 10.1287/OPRE.28.5.1130
Egon Balas, Clarence H. Martin, Pivot and Complement–A Heuristic for 0-1 Programming Management Science. ,vol. 26, pp. 86- 96 ,(1980) , 10.1287/MNSC.26.1.86
C. N. Potts, L. N. Van Wassenhove, Algorithms for scheduling a single machine to minimize the weighted number of late jobs Management Science. ,vol. 34, pp. 843- 858 ,(1988) , 10.1287/MNSC.34.7.843
Richard Loulou, Eleftherios Michaelides, New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem Operations Research. ,vol. 27, pp. 1101- 1114 ,(1979) , 10.1287/OPRE.27.6.1101
E. S. Page, On Monte Carlo Methods in Congestion Problems: II. Simulation of Queuing Systems Operations Research. ,vol. 13, pp. 300- 305 ,(1965) , 10.1287/OPRE.13.2.300