机译:具有序贯竞争的随机背包问题的基于Agent的随机标尺方法
Department of Computer Science. University of Iowa, 14 Maclean Hall Iowa City, IA 52242-1419, USA;
Department of Management Sciences, University of Iowa, 108 John Pappajohn Business Building, Iowa City, IA 52242-1994, USA;
Department of Quantitative Analysis and Operations Management, University of Cincinnati. 532 Carl H. Lindner Hall. Cincinnati, OH 45221-0130, USA;
knapsack problem; sequential allocation; discrete stochastic optimization; stochastic ruler; agent-based simulation; beam search;
机译:基于维修的随机二次多背包问题
机译:一种基于最短路径的随机背包问题,且预期的过剩成本不会减少
机译:解决动态随机多背包问题的近似动态规划方法
机译:生化网络随机分子事件的基于代理的建模方法
机译:估计艾伯塔省南部地区随机灌溉水输送的价值:一种离散的顺序随机规划方法
机译:环境的随机性和种内竞争影响西库蚊(Culex quinquefasciatus)的种群动态。
机译:电子邮件社交网络的建模和仿真:一种基于随机代理的新方法