The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Greedy Randomized Adaptive Search Procedures
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
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
Glover, F. (1990) · ORSA Journal on Computing · doi:10.1287/ijoc.2.1.4 · Cited by 5,647
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
Glover, F. (1989) · ORSA Journal on Computing · doi:10.1287/ijoc.1.3.190 · Cited by 5,106
Optimization by simulated annealing: Quantitative studies
Kirkpatrick, S. (1984) · Journal of Statistical Physics · doi:10.1007/bf01009452 · Cited by 1,805
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
A probabilistic heuristic for a computationally difficult set covering problem
Feo, T. A., & Resende, M. G. C. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90002-3 · Cited by 1,065
Self-citationCliques, Coloring, and Satisfiability
(1996) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/026 · Cited by 476
QAPLIB-A quadratic assignment problem library
Burkard, R. E., Karisch, S., & Rendl, F. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90197-4 · Cited by 332
Avoiding local optima in thep-hub location problem using tabu search and GRASP
Klincewicz, J. G. (1992) · Annals of Operations Research · doi:10.1007/bf02060483 · Cited by 234
Flight Scheduling and Maintenance Base Planning
Feo, T. A., & Bard, J. F. (1989) · Management Science · doi:10.1287/mnsc.35.12.1415 · Cited by 221
Self-citationFulkerson, D. R., Nemhauser, G. L., & Trotter, L. E. (1974) · Mathematical programming studies · doi:10.1007/bfb0120689 · Cited by 109
Cited by
Artificial Intelligence in Supply Chain Management: A Systematic Literature Review
Toorajipour, R., Sohrabpour, V., Nazarpour, A., Oghazi, P., & Fischl, M. (2021) · Journal of Business Research · doi:10.1016/j.jbusres.2020.09.009 · Cited by 1,020
A review of recent advances in global optimization
Floudas, C. A., & Gounaris, C. E. (2009) · Journal of Global Optimization · doi:10.1007/s10898-008-9332-8 · Cited by 455
Designing and reporting on computational experiments with heuristic methods
Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., & Stewart, W. R. (1995) · Journal of Heuristics · doi:10.1007/bf02430363 · Cited by 448
Self-citationGuided local search and its application to the traveling salesman problem
Voudouris, C., & Tsang, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00099-x · Cited by 409
A new dominance rule to minimize total weighted tardiness with unequal release dates
Akturk, M. S., & Ozdemir, D. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00319-2 · Cited by 54
Metadata
- Authors
- Feo, T. A., & Resende, M. G. C.
- Venue
- Journal of Global Optimization
- Published
- 1995-03
- Volume
- 6
- Issue
- 2
- Pages
- 109-133
- ISSN
- 0925-5001 (ISSN-L)
- 1573-2916
- OpenAlex
- W2997776631
- Cited by
- 2,778
- References
- 12
- FWCI
- 16.28
- 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.
