A comparison of alternative input models for synthetic optimization problems
暂无分享,去创建一个
[1] E. Balas,et al. Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .
[2] R. H. F. Jackson,et al. In Pursuit of a Methodology for Testing Mathematical Programming Software , 1982 .
[3] Charles H. Reilly. Optimization test problems with uniformly distributed coefficients , 1991, 1991 Winter Simulation Conference Proceedings..
[4] Bruce W. Schmeiser,et al. Bivariate Gamma Random Vectors , 1982, Oper. Res..
[5] Stephen G. Nash,et al. Guidelines for reporting results of computational experiments. Report of the ad hoc committee , 1991, Math. Program..
[6] Richard Loulou,et al. New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem , 1979, Oper. Res..
[7] Egon Balas,et al. An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..
[8] Harvey J. Greenberg. Computational Testing: Why, How and How Much , 1990, INFORMS J. Comput..
[9] Thuruthickara C. John. Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty , 1989, Comput. Oper. Res..
[10] L. V. Wassenhove,et al. Algorithms for scheduling a single machine to minimize the weighted number of late jobs , 1988 .