An Introduction to Variable Neighborhood Search
The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
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
(1967) · Cited by 23,719
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
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., & Laguna, M. (1997) · Cited by 5,679
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
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Self-citationAn 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
Characterization of molecular branching
Randic, M. (1975) · Journal of the American Chemical Society · doi:10.1021/ja00856a001 · Cited by 3,630
Combinatorial optimization:Algorithms and complexity
Rabiner, L. (1984) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1984.1164450 · Cited by 3,576
Glover, F., & Laguna, M. (1997) · doi:10.1007/978-1-4615-6089-0 · Cited by 3,001
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
TSPLIB—A Traveling Salesman Problem Library
Reinelt, G. (1991) · ORSA Journal on Computing · doi:10.1287/ijoc.3.4.376 · Cited by 2,616
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
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
Sarker, B. R. (1991) · European Journal of Operational Research · doi:10.1016/0377-2217(91)90179-y · Cited by 1,284
Every planar map is four colorable
Appel, K., & Haken, W. (1976) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1976-14122-5 · Cited by 1,109
A Dual-Based Procedure for Uncapacitated Facility Location
Erlenkotter, D. (1978) · Operations Research · doi:10.1287/opre.26.6.992 · Cited by 1,016
Every planar map is four colorable. Part I: Discharging
Appel, K., & Haken, W. (1977) · Illinois Journal of Mathematics · doi:10.1215/ijm/1256049011 · Cited by 884
Local Search in Combinatorial Optimization
(2018) · Princeton University Press eBooks · doi:10.2307/j.ctv346t9c · Cited by 834
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
Teitz, M. B., & Bart, P. (1968) · Operations Research · doi:10.1287/opre.16.5.955 · Cited by 787
Every planar map is four colorable. Part II: Reducibility
Appel, K., Haken, W., & Koch, J. (1977) · Illinois Journal of Mathematics · doi:10.1215/ijm/1256049012 · Cited by 704
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
Gendreau, M., Hertz, A., & Laporte, G. (1992) · Operations Research · doi:10.1287/opre.40.6.1086 · Cited by 644
Robertson, N., Sanders, D., Seymour, P., & Thomas, R. (1997) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1997.1750 · Cited by 598
Combinatorial optimization: algorithms and complexity
Papadimitriou, C. H., & Steiglitz, K. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 486
Fast Algorithms for Geometric Traveling Salesman Problems
Bentley, J. J. (1992) · ORSA Journal on Computing · doi:10.1287/ijoc.4.4.387 · Cited by 468
Variable neighborhood search for the p-median
Hansen, P., & Mladenović, N. (1997) · Location Science · doi:10.1016/s0966-8349(98)00030-8 · Cited by 403
Self-citationA new adaptive multi-start technique for combinatorial global optimizations
Boese, K. D., Kahng, A. B., & Muddu, S. (1994) · Operations Research Letters · doi:10.1016/0167-6377(94)90065-5 · Cited by 375
Algorithms for the maximum satisfiability problem
Hansen, P., & Jaumard, B. (1990) · Computing · doi:10.1007/bf02241270 · Cited by 360
Self-citationA Tabu search approach to the clustering problem
Al‐Sultan, K. S. (1995) · Pattern Recognition · doi:10.1016/0031-3203(95)00022-r · Cited by 304
Fajtlowicz, S. (1988) · Discrete Mathematics · doi:10.1016/0012-365x(88)90199-9 · Cited by 289
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
Cluster Dissection and Analysis: Theory, Fortran Programs, Examples.
Murtagh, F., & Spath, H. (1986) · Biometrics · doi:10.2307/2531267 · Cited by 240
Multidimensional group analysis
Jancey, R. (1966) · Australian Journal of Botany · doi:10.1071/bt9660127 · Cited by 193
Experiments in projection and clustering by simulated annealing
Klein, R. W., & Dubes, R. C. (1989) · Pattern Recognition · doi:10.1016/0031-3203(89)90067-8 · Cited by 176
Cited by
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Self-citationMetaheuristics in Combinatorial Optimization
Gendreau, M., & Potvin, J.-Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3971-7 · Cited by 2,338
Variable neighborhood search: Principles and applications
Hansen, P., & Mladenović, N. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00100-4 · Cited by 1,902
Self-citationA general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
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
Metadata
- Authors
- Hansen, P., & Mladenović, N.
- Venue
- Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
- Publisher
- Springer US
- Published
- 1999
- Pages
- 433-458
- OpenAlex
- W1539750858
- Cited by
- 340
- References
- 39
- FWCI
- 19.21
- Type
- book chapter
- 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.