The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Combining Metaheuristics and Exact Algorithms in Combinatorial Optimization: A Survey and Classification
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Glover, F., & Laguna, M. (1997) · Cited by 5,679
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
(2003) · International Series in Operations Research & Management Science · doi:10.1007/b101874 · Cited by 3,430
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
Handbook of Evolutionary Computation
(1997) · Institute of Physics eBooks · doi:10.1887/0750308958 · Cited by 2,990
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Larraanaga, P., & Lozano, J. A. (2001) · Kluwer Academic Publishers eBooks · Cited by 1,914
Estimation of Distribution Algorithms
(2002) · Genetic Algorithms and Evolutionary Computation · doi:10.1007/978-1-4615-1539-5 · Cited by 1,273
Lourenço, H. R., Martin, O. C., & Stützle, T. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_11 · Cited by 1,164
(2004) · Lecture Notes in Computer Science · doi:10.1007/b100601 · Cited by 1,147
Hutchison, D., Tygar, D., Machado, P., Naor, M., Mattern, F., Cagnoni, S., Caro, G. A., Kleinberg, J. M., Farooq, M., Fink, A., et al. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-01129-0 · Cited by 866
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
Fundamentals of Scatter Search and Path Relinking
Glover, F., Laguna, M., & Martí, R. (2000) · Cited by 743
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5775-3 · Cited by 669
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
Exploring relaxation induced neighborhoods to improve MIP solutions
Danna, E., Rothberg, E., & Pape, C. L. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0518-7 · Cited by 530
Proceedings of IEEE International Conference on Evolutionary Computation
(1996) · doi:10.1109/icec.1996 · Cited by 489
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_5 · Cited by 457
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
Asynchronous Teams: Cooperation Schemes for Autonomous Agents
Talukdar, S., Baerentzen, L., Gove, A., & De Souza, P. (1998) · Journal of Heuristics · doi:10.1023/a:1009669824615 · Cited by 188
A hybrid approach for the 0–1 multidimensional knapsack problem
Vasquez, M., & Hao, J. (2001) · Cited by 138
Principles and Practice of Constraint Programming-CP97
(1997) · Lecture notes in computer science · doi:10.1007/bfb0017424 · Cited by 117
Proceedings of the 2003 ACM symposium on Applied computing
(2003) · doi:10.1145/952532 · Cited by 101
Combinations of Local Search and Exact Algorithms
Dumitrescu, I., & Stützle, T. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36605-9_20 · Cited by 92
Proceedings of the 1998 IEEE International Conference on Evolutionary Computation [Book Review]
Kennedy, J. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.1999.771169 · Cited by 77
French, A. P., Robinson, A. C., & Wilson, J. (2001) · Journal of Heuristics · doi:10.1023/a:1011921025322 · Cited by 46
Cited by
A survey on new generation metaheuristic algorithms
Dokeroglu, T., Sevinc, E., Kucukyilmaz, T., & Cosar, A. (2019) · Computers & Industrial Engineering · doi:10.1016/j.cie.2019.106040 · Cited by 923
Metaheuristic research: a comprehensive survey
Hussain, K., Mohd Salleh, M. N., Cheng, S., & Shi, Y. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-017-9605-z · Cited by 864
Metadata
- Authors
- Puchinger, J., & Raidl, G. R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 41-53
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1572130003
- Cited by
- 323
- References
- 30
- FWCI
- 9.30
- Type
- conference paper
- 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.