The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
OR-Library: Distributing Test Problems by Electronic Mail
Abstract
In this note we present a system (OR-Library) that distributes test problems by electronic mail (e-mail). This system currently has available test problems drawn from a number of different areas of operational research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
Adler, I., Karmarkar, N. K., Resende, M. G. C., & Veiga, G. (1989) · INFORMS journal on computing · doi:10.1287/ijoc.1.2.84 · Cited by 97
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
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
A comprehensive review of firefly algorithms
Fister, I., Fister, I., Yang, X.-S., & Brest, J. (2013) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2013.06.001 · Cited by 1,308
Heuristics for cardinality constrained portfolio optimisation
Chang, T.-J., Meade, N., Beasley, J. E., & Sharaiha, Y. M. (2000) · Computers & Operations Research · doi:10.1016/s0305-0548(99)00074-x · Cited by 926
Self-citationA genetic algorithm for the vehicle routing problem
Baker, B. M., & Ayechew, M. A. (2003) · Computers & Operations Research · doi:10.1016/s0305-0548(02)00051-5 · Cited by 883
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
Self-citationDeterministic job-shop scheduling: Past, present and future
Jain, A. S., & Meeran, S. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00113-1 · Cited by 782
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
Automated Design of Production Scheduling Heuristics: A Review
Branke, J., Nguyen, S., Pickardt, C. W., & Zhang, M. (2016) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2015.2429314 · Cited by 469
The p-median problem: A survey of metaheuristic approaches
Mladenović, N., Brimberg, J., Hansen, P., & Moreno-Pérez, J. A. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.05.034 · Cited by 433
The Hyper-Cube Framework for Ant Colony Optimization
Blum, C., & Dorigo, M. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.821450 · Cited by 432
Bin packing and cutting stock problems: Mathematical models and exact algorithms
Delorme, M., Iori, M., & Martello, S. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.04.030 · Cited by 379
A Survey of Automatic Parameter Tuning Methods for Metaheuristics
Huang, C., Li, Y., & Yao, X. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2921598 · Cited by 371
Application areas of AIS: The past, the present and the future
Hart, E., & Timmis, J. (2008) · Applied Soft Computing · doi:10.1016/j.asoc.2006.12.004 · Cited by 363
Ponsich, A., Jaimes, A. L., & Coello, C. A. C. (2013) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2012.2196800 · Cited by 361
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
Congram, R. K., Potts, C. N., & van de Velde, S. L. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.1.52.7712 · Cited by 306
Parallel metaheuristics: recent advances and new trends
Alba, E., Luque, G., & Nesmachnow, S. (2013) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.2012.00862.x · Cited by 305
Vanderbeck, F. (2000) · Operations Research · doi:10.1287/opre.48.1.111.12453 · Cited by 291
Actor-Critic Deep Reinforcement Learning for Solving Job Shop Scheduling Problems
Liu, C.-L., Chang, C.-C., & Tseng, C.-J. (2020) · IEEE Access · doi:10.1109/access.2020.2987820 · Cited by 281
Genetic programming for production scheduling: a survey with a unified framework
Nguyen, S., Mei, Y., & Zhang, M. (2017) · Complex & Intelligent Systems · doi:10.1007/s40747-017-0036-x · Cited by 279
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., & Wiegele, A. (2010) · Mathematical Programming · doi:10.1007/s10107-008-0235-8 · Cited by 264
The zero/one multiple knapsack problem and genetic algorithms
Khuri, S., Bäck, T., & Heitkötter, J. (1994) · Proceedings of the 1994 ACM symposium on Applied computing - SAC '94 · doi:10.1145/326619.326694 · Cited by 259
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
Error Thresholds in Genetic Algorithms
Ochoa, G. (2006) · Evolutionary Computation · doi:10.1162/evco.2006.14.2.157 · Cited by 71
Metadata
- Authors
- Beasley, J. E.
- Venue
- Journal of the Operational Research Society
- Publisher
- Informa UK Limited
- Published
- 1990-11
- Volume
- 41
- Issue
- 11
- Pages
- 1069-1072
- ISSN
- 0160-5682 (ISSN-L)
- 1476-9360
- OpenAlex
- W2049967755
- Cited by
- 1,899
- References
- 1
- FWCI
- 3.68
- 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.