Test Problems for Computational Experiments -- Issues and Techniques
暂无分享,去创建一个
This paper compares and contrasts real world and random generated test problems as sources of standard tests for mathematical programming algorithms. Real problems are viewed as realizations from a test population of interest, and random problems are treated as models for the population. Methodological advantages and difficulties inherent in the alternatives are highlighted, and methods for dealing with the limitations discussed.
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Ronald L. Rardin,et al. Development of a Parametric Generating Procedure for Integer Programming Test Problems , 1977, JACM.
[3] Benjamin W. Lin,et al. Controlled Experimental Design for Statistical Comparison of Integer Programming Algorithms , 1979 .