The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Designing and reporting on computational experiments with heuristic methods
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
(1979) · Cited by 43,841
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
The visual display of quantitative information
(1985) · General Pharmacology: The Vascular System · doi:10.1016/0306-3623(85)90230-7 · Cited by 5,070
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
Greedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Self-citationTSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
Self-citationThe Visual Display of Quantitative Information.
Zelterman, D., & Tufte, E. R. (1984) · Journal of the American Statistical Association · doi:10.2307/2288294 · Cited by 2,059
Design and Analysis of Experiments
Montgomery, D. C. (1976) · Cited by 1,962
Bratley, P., Fox, B. L., & Schrage, L. E. (1987) · Springer eBooks · doi:10.1007/978-1-4419-8724-2 · Cited by 1,468
The Traveling-Salesman Problem and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
A Tabu Search Heuristic for the Vehicle Routing Problem
Michel Gendreau, A., Hertz, A., & Gilbert Laporte, A. (1994) · Management Science · doi:10.1287/mnsc.40.10.1276 · Cited by 1,303
Design and Analysis of Experiments
Gunter, B. (1985) · Technometrics · doi:10.1080/00401706.1985.10488056 · Cited by 1,197
The traveling-salesman problem and minimum spanning trees: Part II
Held, M., & Karp, R. M. (1971) · Mathematical Programming · doi:10.1007/bf01584070 · Cited by 1,018
A Best Possible Heuristic for the k-Center Problem
Hochbaum, D. S., & Shmoys, D. B. (1985) · Mathematics of Operations Research · doi:10.1287/moor.10.2.180 · Cited by 921
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
A comparison of heuristics and relaxations for the capacitated plant location problem
Cornuejols, G., Sridharan, R., & Thizy, J. M. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90261-s · Cited by 285
Needed: An Empirical Science of Algorithms
Hooker, J. N. (1994) · Operations Research · doi:10.1287/opre.42.2.201 · Cited by 213
Nelder-Mead Simplex Modifications for Simulation Optimization
Barton, R. R., & Ivey, J. S. (1996) · Management Science · doi:10.1287/mnsc.42.7.954 · Cited by 209
Tabu search performance on the symmetric traveling salesman problem
Knox, J. (1994) · Computers & Operations Research · doi:10.1016/0305-0548(94)90016-7 · Cited by 132
Evolutionary Operation: A Statistical Method for Process Improvement
Ziegel, E. R., Box, G. E. P., & Draper, N. R. (1998) · Technometrics · doi:10.2307/1270554 · Cited by 128
Worst-Case Analysis of Heuristic Algorithms
Fisher, M. L. (1980) · Management Science · doi:10.1287/mnsc.26.1.1 · Cited by 126
On Reporting Computational Experiments with Mathematical Software
Crowder, H. P., Dembo, R. S., & Mulvey, J. M. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355826.355833 · Cited by 83
Experimentation in optimization
Golden, B., Assad, A. A., Wasil, E., & Baker, E. K. (1986) · European Journal of Operational Research · doi:10.1016/s0377-2217(86)80002-9 · Cited by 18
Self-citationNetwork Reoptimization Algorithms: A Statistically Designed Comparison
Amini, M. M., & Barr, R. S. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.4.395 · Cited by 15
Self-citation
Cited by
Metaheuristics—the metaphor exposed
Sörensen, K. (2015) · International Transactions in Operational Research · doi:10.1111/itor.12001 · Cited by 1,051
Benchmarking in Optimization: Best Practice and Open Issues
Bartz-Beielstein, T., Doerr, C., Berg, D. V. D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., La Cava, W., Lopez-Ibanez, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2007.03488 · Cited by 214
Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
Balaprakash, P., Birattari, M., & Stützle, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75514-2_9 · Cited by 197
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Dunning, I., Gupta, S., & Silberholz, J. (2018) · INFORMS Journal on Computing · doi:10.1287/ijoc.2017.0798 · Cited by 128
Benchmarking a quantum annealing processor with the time-to-target metric
King, J., Yarkoni, S., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2015) · arXiv · doi:10.48550/arxiv.1508.05087 · Cited by 77
Metadata
- Authors
- Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., & Stewart, W. R.
- Venue
- Journal of Heuristics
- Published
- 1995-09
- Volume
- 1
- Issue
- 1
- Pages
- 9-32
- ISSN
- 1381-1231 (ISSN-L)
- 1572-9397
- OpenAlex
- W2095478116
- Cited by
- 448
- References
- 32
- FWCI
- 9.10
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
