{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T18:02:56Z","timestamp":1779300176743,"version":"3.51.4"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1023\/a:1011319115230","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"261-304","source":"Crossref","is-referenced-by-count":266,"title":["Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial"],"prefix":"10.1007","volume":"7","author":[{"given":"Ronald L.","family":"Rardin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reha","family":"Uzsoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"332830_CR1","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1287\/ijoc.8.3.318","volume":"8","author":"R.K. Ahuja","year":"1996","unstructured":"Computational Testing of Algorithms.\u201d INFORMS Journal on Computing 8, 318\u2013330.","journal-title":"INFORMS Journal on Computing"},{"key":"332830_CR2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1057\/jors.1988.27","volume":"39","author":"J.L. Arthur","year":"1988","unstructured":"Arthur, J.L. and J.O. Frendewey. (1988). \u201cGenerating Travelling Salesman Problems with Known Optimal Tour Length.\u201d Journal of the Operational Research Society 39, 153\u2013159.","journal-title":"Journal of the Operational Research Society"},{"key":"332830_CR3","unstructured":"Baker, K.R. (1997). \u201cHeuristic Procedures for Scheduling Job Families with Setups and Due Dates.\u201d Working paper, Amos Tuck School of Business Administration, Dartmouth College."},{"key":"332830_CR4","unstructured":"Baker, K.R. and M.J. Magazine. (1997). \u201cMinimizing Maximum Lateness with Job Families.\u201d Working paper, Amos Tuck School of Business Administration, Dartmouth College."},{"key":"332830_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.S. Barr","year":"1995","unstructured":"Barr, R.S., B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart. (1995). \u201cDesigning and Reporting on Computational Experiments with Heuristic Methods.\u201d Journal of Heuristics 1, 9\u201332.","journal-title":"Journal of Heuristics"},{"key":"332830_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1287\/ijoc.5.1.2","volume":"5","author":"R.S. Barr","year":"1993","unstructured":"Barr, R.S. and B.L. Hickman. (1993). \u201cReporting Computational Experiments with Parallel Algorithms: Issues, Measures and Experts Opinions.\u201d ORSA Journal on Computing 5, 2\u201318.","journal-title":"ORSA Journal on Computing"},{"key":"332830_CR7","volume-title":"TSPLIB, Software Library","author":"B. Bixby","year":"1990","unstructured":"Bixby, B. and G. Reinelt. (1990). TSPLIB, Software Library, Rice University, Houston, Texas."},{"key":"332830_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01581033","volume":"22","author":"C.G.E. Boender","year":"1982","unstructured":"Boender, C.G.E., A.H.G. Rinnooy Kan, L. Stougie, and G.T. Timmer. (1982). \u201cA Stochastic Method for Global Optimization.\u201d Mathematical Programming 22, 125\u2013140.","journal-title":"Mathematical Programming"},{"key":"332830_CR9","first-page":"73","volume":"27","author":"R.E. Burkard","year":"1983","unstructured":"Burkard, R.E. and U. Fincke. (1983). \u201cThe Asymptotic Probabilistc Behaviour of Quadratic Sum Assignment Problems.\u201d Z. Opns. Res. 27, 73\u201381.","journal-title":"Z. Opns. Res."},{"key":"332830_CR10","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/mnsc.34.3.266","volume":"34","author":"E.G. Coffman","year":"1988","unstructured":"Coffman, E.G., G.S. Lueker, and A.H.G. Rinnooy Kan. (1988). \u201cAsymptotic Methods in the Probablistic Analysis of Sequencing and Packing Heuristics.\u201d Management Science 34, 266\u2013290.","journal-title":"Management Science"},{"key":"332830_CR11","volume-title":"Practical Nonparametric Statistics","author":"W.J. Conover","year":"1980","unstructured":"Conover, W.J. (1980). Practical Nonparametric Statistics. New York: John Wiley."},{"key":"332830_CR12","first-page":"21","volume":"AAAI93","author":"J.M. Crawford","year":"1983","unstructured":"Crawford, J.M. and L.D. Auton. (1983). \u201cExperimental Results on the Crossover Point in Satisfiability Problems.\u201d In Proceedings of the Eleventh National Conference on Artificial Intelligence AAAI93. pp. 21\u201327.","journal-title":"Proceedings of the Eleventh National Conference on Artificial Intelligence"},{"key":"332830_CR13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/355826.355833","volume":"5","author":"H.P. Crowder","year":"1979","unstructured":"Crowder, H.P., R.S. Dembo, and J.M. Mulvey. (1979). \u201cOn Reporting Computational Experiments with Mathematical Software.\u201d ACM Transactions on Mathematical Software 5, 193\u2013203.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"332830_CR14","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1287\/mnsc.23.12.1273","volume":"23","author":"D. Dannenbring","year":"1977","unstructured":"Dannenbring, D. (1977). \u201cEstimating Optimal Solutions for Large Combinatorial Problems.\u201d Management Science 23, 1273\u20131283.","journal-title":"Management Science"},{"key":"332830_CR15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","volume":"109","author":"E. Demirkol","year":"1998","unstructured":"Demirkol, E., S.V. Mehta, and R. Uzsoy. (1998). \u201cBenchmarks for Shop Scheduling Problems.\u201d European Journal of Operational Research 109, 137\u2013141.","journal-title":"European Journal of Operational Research"},{"key":"332830_CR16","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1287\/opre.33.5.1024","volume":"33","author":"U. Derigs","year":"1985","unstructured":"Derigs, U. (1985). \u201cUsing Confidence Limits for the Global Optimal in Combinatorial Optimization.\u201d Operations Research 33, 1024\u20131049.","journal-title":"Operations Research"},{"key":"332830_CR17","unstructured":"Fargher, H.E. and R.A. Smith. (1994). \u201cPlanning in a Flexible Semiconductor Manufacturing Environment.\u201d In M. Zweben and M. Fox (eds.), Intelligent Scheduling. Morgan Kaufman."},{"key":"332830_CR18","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963","unstructured":"Fisher, H. and G.L. Thompson. (1963). \u201cProbabilistic Learning Combinations of Local Job-Shop Scheduling Rules.\u201d In J.F. Muth and G.L. Thompson (eds.), Industrial Scheduling. New Jersey: Prentice-Hall, Englewood Cliffs."},{"key":"332830_CR19","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1017\/S0305004100015681","volume":"24","author":"R. Fisher","year":"1928","unstructured":"Fisher, R. and L. Tippett. (1928). \u201cLimiting Forms of the Frequency Distribution of the Largest or Smallest Member of a Sample.\u201d Proceedings of the Cambridge Philosophical Society 24, 180\u2013190.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"332830_CR20","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W. H. Freeman."},{"key":"332830_CR21","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/322077.322086","volume":"25","author":"R.S. Garfinkel","year":"1978","unstructured":"Garfinkel, R.S. and K.C. Gilbert. (1978). \u201cThe Bottleneck Traveling Salesman Problem: Algorithms and Probabilistic Analysis.\u201d Journal of the ACM 25, 435\u2013448.","journal-title":"Journal of the ACM"},{"key":"332830_CR22","unstructured":"Ghashghai, E. and R.L. Rardin. (1998). \u201cUsing a Hybrid of Exact and Genetic Algorithms to Design Survivable Networks.\u201d Working paper, School of Industrial Engineering, Purdue University."},{"key":"332830_CR23","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.3230070303","volume":"7","author":"B.L. Golden","year":"1977","unstructured":"Golden, B.L. (1977). \u201cA Statistical Approach to the TSP.\u201d Networks 7, 209\u2013225.","journal-title":"Networks"},{"key":"332830_CR24","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/03610917808812084","volume":"B7","author":"B.L. Golden","year":"1978","unstructured":"Golden, B.L. (1978). \u201cPoint Estimation of a Global Optimum for Large Combinatorial Problems.\u201d Communications in Statistics B7, 361\u2013367.","journal-title":"Communications in Statistics"},{"key":"332830_CR25","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/nav.3800260108","volume":"26","author":"B.L. Golden","year":"1979","unstructured":"Golden, B.L. and F.B. Alt. (1979). \u201cInterval Estimation of a Global Optimum for Large Combinatorial Problems.\u201d Naval Research Logistics Quarterly 26, 69\u201377.","journal-title":"Naval Research Logistics Quarterly"},{"key":"332830_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(86)80002-9","volume":"27","author":"B.L. Golden","year":"1986","unstructured":"Golden, B.L., A.A. Assad, E.A. Wasil, and E. Baker. (1986). \u201cExperimentation in Optimization.\u201d European Journal of Operational Research 27, 1\u201316 (1986).","journal-title":"European Journal of Operational Research"},{"key":"332830_CR27","volume-title":"The Traveling Salesman problem: A Guided Tour of Combinatorial Optimization","author":"B.L. Golden","year":"1985","unstructured":"Golden, B.L. and W.R. Stewart. (1985). \u201cEmpirical Evaluation of Heuristics.\u201d In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.), The Traveling Salesman problem: A Guided Tour of Combinatorial Optimization. New York: John Wiley."},{"key":"332830_CR28","volume-title":"Handbook of Stimulation","author":"D. Goldsman","year":"1999","unstructured":"Goldsman, D. and B.L. Nelson. (1999). \u201cComparing Systems via Simulation.\u201d In J. Banks (ed.), Handbook of Stimulation. New York: John Wiley."},{"key":"332830_CR29","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L. (1969). \u201cBounds on Multiprocessor Timing Anomalies.\u201d SIAM Journal of Applied Mathematics 17, 416\u2013429.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"332830_CR30","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/ijoc.2.1.94","volume":"2","author":"H.J. Greenberg","year":"1990","unstructured":"Greenberg, H.J. (1990). \u201cComputational Testing: Why, How and How Much.\u201d ORSA Journal on Computing 2, 94\u201397.","journal-title":"ORSA Journal on Computing"},{"key":"332830_CR31","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tchel, M. and M.W. Padberg (1979). \u201cOn the Symmetric Traveling Salesman Problem I: Inequalities.\u201d Mathematical Programming 16.","DOI":"10.1007\/BF01582116"},{"key":"332830_CR32","volume-title":"The Traveling Salesman problem: A Guided Tour of Combinatorial Optimization","author":"M. Gr\u00f6tchel","year":"1985","unstructured":"Gr\u00f6tchel, M. and M.W. Padberg. (1985). \u201cPolyhedral Aspects of the Traveling Salesman Problem I: Theory.\u201d In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (eds.), The Traveling Salesman problem: A Guided Tour of Combinatorial Optimization. New York: John Wiley."},{"key":"332830_CR33","unstructured":"Hall, N.G. and M. Posner. (1996). \u201cGenerating Experimental Data for Scheduling Problems.\u201d Research report, College of Business, Ohio State University."},{"key":"332830_CR34","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018903027868","volume":"70","author":"A.M.A. Hariri","year":"1997","unstructured":"Hariri, A.M.A. and C.N. Potts. (1997). \u201cSingle Machine Scheduling with Batch Set-up Times to Minimize Maximum Lateness.\u201d Annals of Operations Research 70, 75\u201392.","journal-title":"Annals of Operations Research"},{"key":"332830_CR35","unstructured":"Hill, R.R. and C.H. Reilly. (1996a). \u201cMultivariate Composite Distributions for Co-efficients in Synthetic Optimization Problems.\u201d Research report, Department of Industrial, Welding and Systems Engineering, Ohio State University."},{"key":"332830_CR36","unstructured":"Hill, R.R. and C.H. Reilly. (1996b). \u201cThe Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance.\u201d Research report, Department of Industrial, Welding and Systems Engineering, Ohio State University."},{"key":"332830_CR37","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1287\/opre.42.2.201","volume":"42","author":"J. Hooker","year":"1994","unstructured":"Hooker, J. (1994). \u201cNeeded: An Empirical Science of Algorithms.\u201d Operations Research 42, 201\u2013212.","journal-title":"Operations Research"},{"key":"332830_CR38","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J. Hooker","year":"1995","unstructured":"Hooker, J. (1995). \u201cTesting Heuristics: We Have It All Wrong.\u201d Journal of Heuristics 1, 33\u201342.","journal-title":"Journal of Heuristics"},{"key":"332830_CR39","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01588801","volume":"49","author":"R.H.F. Jackson","year":"1991","unstructured":"Jackson, R.H.F., P.T. Boggs, S.G. Nash, and S. Powell. (1991). \u201cGuidelines for Reporting Results of Computational Experiments: Report of the Ad Hoc Committee.\u201d Mathematical Programming 49, 413\u2013425.","journal-title":"Mathematical Programming"},{"key":"332830_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4121-9","volume-title":"Visualization and Optimization","author":"C.V. Jones","year":"1996","unstructured":"Jones, C.V. (1996). Visualization and Optimization. Boston: Kluwer Academic Publishers. Boston."},{"key":"332830_CR41","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1977). \u201cProbabilistic Analysis of Partitioning Algorithms for the Traveling Salesman Problem in the Plane.\u201d Mathematics of Operations Research 2, 209\u2013224.","DOI":"10.1287\/moor.2.3.209"},{"key":"332830_CR42","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/168173.168420","volume":"19","author":"B.N. Khoury","year":"1993","unstructured":"Khoury, B.N., P.M. Paradalos, and D.Z. Zhu. (1993). \u201cA Test Problem Generator for the Steiner Problem in Graphs.\u201d ACM Transactions on Mathematical Software 19, 509\u2013522.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"332830_CR43","first-page":"394","volume":"12","author":"M.D. Kilbridge","year":"1996","unstructured":"Kilbridge, M.D. and L. Wester. (1996). \u201cA Heuristic Method of Assembly Line Balancing.\u201d Journal of Industrial Engineering 12, 394\u2013398.","journal-title":"Journal of Industrial Engineering"},{"key":"332830_CR44","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/00207548008919662","volume":"18","author":"J.R. King","year":"1980","unstructured":"King, J.R. (1980). \u201cMachine-Component Grouping in Production Flow Analysis: An Approach Using a Rank Order Clustering Algorithm.\u201d International Journal of Production Research 18, 213\u2013232.","journal-title":"International Journal of Production Research"},{"key":"332830_CR45","volume-title":"Ph.D. Dissertation","author":"S. Klein","year":"1975","unstructured":"Klein, S. (1975). \u201cMonte Carlo Estimation in Complex Optimization Problems.\u201d Ph.D. Dissertation, George Washington University, Washington, D.C."},{"key":"332830_CR46","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TC.1987.5009543","volume":"36","author":"B. Krishnamurthy","year":"1987","unstructured":"Krishnamurthy, B. (1987). \u201cConstructing Test Cases for Partitioning Heuristics.\u201d IEEE Transactions on Computing 36, 1112\u20131114.","journal-title":"IEEE Transactions on Computing"},{"key":"332830_CR47","volume-title":"Simulation Design and Analysis","author":"A.M. Law","year":"1991","unstructured":"Law, A.M. and W.D. Kelton. (1991). Simulation Design and Analysis, 2nd edn. New York: McGraw-Hill, Inc.","edition":"2nd edn."},{"key":"332830_CR48","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1080\/07408179308964279","volume":"25","author":"C.Y. Lee","year":"1993","unstructured":"Lee, C.Y., J. Bard, M. Pinedo, and W.E. Wilhelm. (1993). \u201cGuidelines for Reporting Computational Results in IIE Transactions.\u201d IIE Transactions 25, 71\u201373.","journal-title":"IIE Transactions"},{"key":"332830_CR49","volume-title":"Mathematical Center Tract 69","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K. (1977). \u201cSequencing by Enumerative Methods.\u201d Mathematical Center Tract 69, Mathematisch Centrum, Amsterdam."},{"key":"332830_CR50","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1287\/mnsc.25.12.1258","volume":"25","author":"B.W. Lin","year":"1980","unstructured":"Lin, B.W. and R.L. Rardin. (1980). \u201cControlled Experimental Design for Statistical Comparison of Integer Programming Algorithms.\u201d Management Science 25, 1258\u20131271.","journal-title":"Management Science"},{"key":"332830_CR51","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and B.W. Kernighan. (1973). \u201cAn Effective Heuristic Method for the Travelling Salesman Problem.\u201d Operations Research 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"332830_CR52","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0191-2615(82)90030-3","volume":"16B","author":"M. Los","year":"1982","unstructured":"Los, M. and C. Lardinois. (1982). \u201cCombinatorial Programming, Satistical Optimization and the Optimal Transportation Network.\u201d Transportation Research Board 16B, 89\u2013124.","journal-title":"Transportation Research Board"},{"key":"332830_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.8.1.1","volume":"8","author":"C.C. McGeoch","year":"1996","unstructured":"McGeoch, C.C. (1996). \u201cTowards an Experimental Method for Algorithm Simulation.\u201d INFORMS Journal on Computing 8, 1\u201315.","journal-title":"INFORMS Journal on Computing"},{"key":"332830_CR54","first-page":"459","volume":"AAA192","author":"D. Mitchell","year":"1992","unstructured":"Mitchell, D., B. Selman, and H. Leveque. (1992). \u201cHard and Easy Distributions of SAT Problems.\u201d In Proceedings of the Tenth National Conference on Artificial Intelligence AAA192. 459\u2013465.","journal-title":"Proceedings of the Tenth National Conference on Artificial Intelligence"},{"key":"332830_CR55","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"C. Monma","year":"1989","unstructured":"Monma, C. and C.N. Potts. (1989). \u201cOn the Complexity of Scheduling with Batch Setup Times.\u201d Operations Research 37, 798\u2013804.","journal-title":"Operations Research"},{"key":"332830_CR56","volume-title":"Design and Analysis of Experiments","author":"D.C. Montgomery","year":"1991","unstructured":"Montgomery, D.C. (1991). Design and Analysis of Experiments, 3rd edn. New York: John Wiley.","edition":"3rd edn."},{"key":"332830_CR57","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/ijoc.10.2.121","volume":"10","author":"P. Moscato","year":"1998","unstructured":"Moscato, P. and M.G. Norman. (1998). \u201cOn the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem.\u201d INFORMS Journal on Computing 10, 121\u2013132.","journal-title":"INFORMS Journal on Computing"},{"key":"332830_CR58","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1009669326107","volume":"6","author":"I.M. Ovacik","year":"2000","unstructured":"Ovacik, I.M., S. Rajagopalan, and R. Uzsoy. (2000). \u201cIntegrating Interval Estimates of Global Optima and Local Search Methods for Combinatorial Optimization Problems.\u201d Journal of Heuristics, 6, 481\u2013500.","journal-title":"Journal of Heuristics"},{"key":"332830_CR59","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6329-7","volume-title":"Decomposition Methods for Complex Factory Scheduling Problems","author":"I.M. Ovacik","year":"1997","unstructured":"Ovacik, I.M. and R. Uzsoy. (1997). Decomposition Methods for Complex Factory Scheduling Problems. Boston: Kluwer Academic Publishers."},{"key":"332830_CR60","series-title":"ONR-URI Computational Combinatorics Report","volume-title":"Invariant Problem Statistics and Generated Data Validation: Symmetric Traveling Salesman Problems","author":"M.G. Plicher","year":"1988","unstructured":"Plicher, M.G. and R.L. Rardin. (1988). \u201cInvariant Problem Statistics and Generated Data Validation: Symmetric Traveling Salesman Problems.\u201d ONR-URI Computational Combinatorics Report CC-87-16, Purdue University, West Lafayette, Indiana."},{"key":"332830_CR61","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1002\/1520-6750(199210)39:6<839::AID-NAV3220390609>3.0.CO;2-C","volume":"39","author":"M.G. Pilcher","year":"1992","unstructured":"Pilcher, M.G. and R.L. Rardin (1992). \u201cPartial Polyhedral Description and Generation of Discrete Optimization Problems with Known Optima.\u201d Naval Research Logistics 39, 839\u2013858.","journal-title":"Naval Research Logistics"},{"key":"332830_CR62","volume-title":"Scheduling: Theory, Algorithms and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling: Theory, Algorithms and Systems. New York: Prentice-Hall."},{"key":"332830_CR63","volume-title":"Evaluating Mathematical Programming Techniques","author":"R.L. Rardin","year":"1982","unstructured":"Rardin, R.L. and B.W. Lin. (1982). \u201cTest Problems for Computational Experiments-Issues and Techniques.\u201d In M. Beckmann and H. P. Kunzi (eds.), Evaluating Mathematical Programming Techniques,Berlin: Springer-Verlag."},{"key":"332830_CR64","doi-asserted-by":"crossref","unstructured":"Rardin, R.L., C.A. Tovey, and M.G. Pilcher. (1993). \u201cAnalysis of a Random Cut Test Instance Generator for the TSP.\u201d In P.M. Pardalos (ed.), Complexity in Numerical Optimization,World Scientific Publishing, pp. 387\u2013405.","DOI":"10.1142\/9789814354363_0017"},{"key":"332830_CR65","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0020-0190(90)90082-9","volume":"36","author":"L.A. Sanchis","year":"1990","unstructured":"Sanchis, L.A. (1990). \u201cOn the Complexity ofTest Case Generation for NP-Hard Problems.\u201d Information Processing Letters 36, 135\u2013140.","journal-title":"Information Processing Letters"},{"key":"332830_CR66","volume-title":"Computational Support for Discrete Mathematics","author":"L.A. Sanchis","year":"1994","unstructured":"Sanchis, L.A. (1994). \u201cTest Case construction for the Vertex Cover Problem.\u201d In Computational Support for Discrete Mathematics. DIMACS Series in Discrete Mathematics and Theoretical American Mathematical Society. Computer Science, Providence, Rhode Island: vol. 15."},{"key":"332830_CR67","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(93)E0140-T","volume":"58","author":"L.A. Sanchis","year":"1995","unstructured":"Sanchis, L.A. (1995). \u201cGenerating Hard and Diverse Test Sets for NP-Hard Graph Problems.\u201d Discrete Applied Mathematics 58, 35\u201366.","journal-title":"Discrete Applied Mathematics"},{"key":"332830_CR68","unstructured":"Song, W.T. and B.W. Schmeiser. (1994). \u201cReporting the Precision of Simulation Experiments.\u201d In S. Morito, S. Sakasegawa, H. Yoneda, M. Fushimi, and K. Nakano (eds.), New Directions in Simulation for Manufacturing and Communications. pp. 402\u2013407."},{"key":"332830_CR69","volume-title":"The Visual Display of Quantitative Information","author":"E.R. Tufte","year":"1983","unstructured":"Tufte, E.R. (1983). The Visual Display of Quantitative Information. Cheshire, Connecticut: Graphics Press."},{"key":"332830_CR70","volume-title":"Envisioning Information","author":"E. R. Tufte","year":"1990","unstructured":"Tufte, E. R. (1990). Envisioning Information. Cheshire, Connecticut: Graphics Press."},{"key":"332830_CR71","volume-title":"Exploratory Data Analysis","author":"J.W. Tukey","year":"1977","unstructured":"Tukey, J.W. (1977). Exploratory Data Analysis. Reading, Massachusetts: Addison-Wesley."},{"key":"332830_CR72","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/1520-6750(199204)39:3<369::AID-NAV3220390307>3.0.CO;2-F","volume":"39","author":"R. Uzsoy","year":"1992","unstructured":"Uzsoy, R., C.Y. Lee, and L.A. Martin-Vega. (1992). \u201cScheduling Semiconductor Test Operations: Minimizing Maximum Lateness and Number of Tardy Jobs on a Single Machine.\u201d Naval Research Logistics 39, 369\u2013388.","journal-title":"Naval Research Logistics"},{"key":"332830_CR73","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0646-7","volume-title":"Visualization of Natural Phenomena","author":"R.S. Wolff","year":"1993","unstructured":"Wolff, R.S. and L. Yaeger. (1993). Visualization of Natural Phenomena. New York: Springer-Verlag."},{"key":"332830_CR74","doi-asserted-by":"crossref","first-page":"428","DOI":"10.15807\/jorsj.39.428","volume":"33","author":"K. Yoneda","year":"1996","unstructured":"Yoneda, K. (1996). \u201cOptimal Number of Digits to Report.\u201d Journal of the Operations Research Society of Japan 33, 428\u2013434.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"332830_CR75","first-page":"63","volume":"7","author":"S.H. Zanakis","year":"1977","unstructured":"Zanakis, S.H. (1977). \u201cComputational Experience with Some Nonlinear Optimization Algorithms for Deriving Maximum Likelihood Estimates for Three Parameter Weibull Distribution.\u201d TIMS Studies in Management Science 7, 63\u201377.","journal-title":"TIMS Studies in Management Science"},{"key":"332830_CR76","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1080\/00949657908810302","volume":"9","author":"S.H. Zanakis","year":"1979","unstructured":"Zanakis, S.H. (1979). \u201cA Simulation Study of Some Simple Estimators of the Three-Parameter Weibull Distribution.\u201d Journal of Statistical Computing and Simulation 9, 419\u2013428.","journal-title":"Journal of Statistical Computing and Simulation"},{"key":"332830_CR77","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0377-2217(89)90412-8","volume":"43","author":"S.H. Zanakis","year":"1989","unstructured":"Zanakis, S.H., J.R. Evans, and A.A. Vazacopoulos. (1989). \u201cHeuristic Methods and Applications: A Categorized Survey.\u201d European Journal of Operational Research 43, 88\u2013110.","journal-title":"European Journal of Operational Research"},{"key":"332830_CR78","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/nav.3800290305","volume":"29","author":"S.H. Zanakis","year":"1982","unstructured":"Zanakis, S.H. and N. Mann. (1982). \u201cA Good Simple Percentile Estimator of the Weibull Shape Parameter for Use When All Three Parameters Are Unknown.\u201d Naval Research Logistics Quarterly 29, 419\u2013428.","journal-title":"Naval Research Logistics Quarterly"},{"key":"332830_CR79","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/moor.6.3.319","volume":"6","author":"E. Zemel","year":"1981","unstructured":"Zemel, E. (1981). \u201cMeasuring the Quality of Approximate Solutions to Zero-One Programming Problems.\u201d Mathematics of Operations Research 6, 319\u2013332.","journal-title":"Mathematics of Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011319115230.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011319115230\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011319115230.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:04:56Z","timestamp":1747652696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011319115230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":79,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["332830"],"URL":"https:\/\/doi.org\/10.1023\/a:1011319115230","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}