Variable neighborhood search: Principles and applications

Anderberg, 1973 Beasley, 1985, A note on solving large p-median problems, European Journal of Operational Research, 21, 270, 10.1016/0377-2217(85)90040-2 Bentley, 1992, Fast algorithms for geometric traveling salesman problem, ORSA Journal on Computing, 4, 387, 10.1287/ijoc.4.4.387 Boese, 1994, A new adaptive multi-start technique for combinatorial global optimizations, Operational Research Letters, 16, 101, 10.1016/0167-6377(94)90065-5 Brimberg, 1996, A variable neighborhood algorithm for solving the continuous location-allocation problem, Studies in Location Analysis, 10, 1 J. Brimberg, P. Hansen, N. Mladenović, É. Taillard, Improvements and comparison of heuristics for solving the multisource Weber problem, Operations Research 48 (3) (2000) Brinkmann, 1996, Fast generation of cubic graphs, Journal of Graph Theory, 23, 139, 10.1002/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U Caporossi, 1999, Variable neighborhood search for chemical graphs, Part 2, Graphs with extremal energy, Journal of Chemical Information and Computer Sciences, 39, 984, 10.1021/ci9801419 Caporossi, 2000, Variable neighborhood search for extremal graphs, 1. The AutoGraphix system, Discrete Mathematics, 212, 29, 10.1016/S0012-365X(99)00206-X Cooper, 1963, Location–allocation problems, Operational Research, 11, 331, 10.1287/opre.11.3.331 Dorigo, 1996, The ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics – Part B, 26, 29, 10.1109/3477.484436 du Merle, 1999, Stabilized column generation, Discrete Applied Mathematics, 194, 229, 10.1016/S0012-365X(98)00213-1 du Merle, 2000, An interior point algorithm for minimum sum-of-squares clustering, SIAM Journal on Scientific Computing, 21, 1485, 10.1137/S1064827597328327 Feo, 1995, Greedy randomized adaptive search, Journal of Global Optimization, 6, 109, 10.1007/BF01096763 Fajtlowicz, 1987, On conjectures of Graffiti, Discrete Mathematics, 72, 113, 10.1016/0012-365X(88)90199-9 Fajtlowicz, 1987, On conjectures of Graffiti-II, Congressus Numerantium, 60, 187 Fajtlowicz, 1988, On conjectures of Graffiti-III, Congressus Numerantium, 66, 23 Fajtlowicz, 1990, On conjectures of Graffiti-IV, Congressus Numerantium, 70, 231 Fajtlowicz, 1995, On conjectures of Graffiti-V, Seventh International Quadrennial Conference on Graph Theory, 1, 367 R.A. Fisher, The use of multiple measurements in taxonomic problems, in Annual Eugenics VII, Part II, 1936, pp. 179–188 Gendreau, 1992, New insertion and postoptimization procedures for the traveling salesman problem, Operational Research, 40, 1086, 10.1287/opre.40.6.1086 Gendreau, 1996, The traveling salesman problem with back-hauls, Computers and Operational Research, 23, 501, 10.1016/0305-0548(95)00036-4 Glover, 1989, Tabu search – Part II, ORSA Jounal of Computing, 1, 190, 10.1287/ijoc.1.3.190 Glover, 1990, Tabu search – Part II, ORSA Journal of Computing, 2, 4, 10.1287/ijoc.2.1.4 F. Glover, M. Laguna, Tabu search, in: C. Reeves (Ed.), Modern Heuristic Techniques for Combinatorial Optimization, Blackwell, Oxford, 1993, pp. 70–150 Glover, 1995, Tabu thresholding: Improved search by nonmonotonic trajectories, ORSA Journal of Computing, 7, 426, 10.1287/ijoc.7.4.426 Glover, 1997 Gordon, 1981 Gutman, 1986 Hansen, 1990, Algorithms for the maximum satisfiability problem, Computing, 44, 279, 10.1007/BF02241270 P. Hansen, B. Jaumard, S. Krau, O. du Merle, A stabilized column generation algorithm for the multisource Weber problem (in preparation) P. Hansen, B. Jaumard, N. Mladenović, A. Parreira, Variable neighborhood search for weighted maximum satisfiability (in preparation) Hansen, 1998, Variable neighborhood search for the p-median, Location Science, 5, 207, 10.1016/S0966-8349(98)00030-8 P. Hansen, N. Mladenović, J-MEANS, a new local search heuristic for minimum sum-of-squares clustering, Les Cahiers du GERAD G-99-14 and Pattern Recognition, forthcoming P. Hansen, N. Mladenović, An introduction to variable neighbourhood search. in: S. Voss et al. (Eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization, Kluwer Academic Publishers, Dordrecht, 1999, pp. 433–458 P. Hansen, N. Mladenović, D. Perez-Brito, Variable Neighborhood Decomposition Search, Journal of Heuristics, forthcoming Hertz, 1994, Local optima topology for the k-coloring problem, Discrete Applied Mathematics, 49, 257, 10.1016/0166-218X(94)90212-7 Holland, 1975 Jancey, 1966, Multidimensional Group Analysis, Australian Journal of Botany, 14, 127, 10.1071/BT9660127 D.S. Johnson, L.A. McGeoch, The traveling salesman problem: a case study in local optimization, in: E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, London, 1997, pp. 215–310 Kariv, 1969, An algorithmic approach to network location problems; Part 2, the p-medians, SIAM Journal on Applied Mathematics, 37, 539, 10.1137/0137041 Kirkpatrick, 1983, Optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671 Kirkpatrick, 1985, Configuration space analysis of traveling salesman problems, Journal de Physique, 46, 1277, 10.1051/jphys:019850046080127700 S. Krau, Extensions du problème de Weber, Ph D. Thesis, École Polytechnique de Montréal (under direction of P. Hansen and B. Jaumard), 1997 Kuenne, 1972, Exact and approximate solutions to the multisource Weber problem, Mathematical Programming, 3, 193, 10.1007/BF01584989 Lin, 1965, Computer solutions of the traveling salesman problem, Bell Systems Technical Journal, 44, 2245, 10.1002/j.1538-7305.1965.tb04146.x Lin, 1973, An effective heuristic algorithm for the traveling salesman problem, Operational Research, 21, 498, 10.1287/opre.21.2.498 MacQueen, 1967, Some methods for classification and analysis of multivariate observations, in: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1, 281 1990 N. Mladenović, A variable neighborhood algorithm: A new metaheuristic for combinatorial optimization, Abstracts of papers presented at Optimization Days, Montréal, 1995, p. 112 Mladenović, 1996, A chain-interchange heuristic method, Yugoslav Journal of Operational Research, 6, 41 Mladenović, 1997, Variable neighborhood search, Computers and Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2 Osman, 1994, Capacitated clustering problems by hybrid simulated annealing and Tabu search, International Transactions on Operational Research, 1, 317, 10.1016/0969-6016(94)90032-9 Osman, 1996, Metaheuristics: A bibliography, Annals of Operational Research, 63, 513, 10.1007/BF02125421 Papadimitriou, 1982 1993 Reinelt, 1991, TSLIB – a traveling salesman library, ORSA Journal of Computing, 3, 376, 10.1287/ijoc.3.4.376 M.G.C. Resende, L.S. Pitsoulis, P.M. Pardalos, Approximate solution of weighted max-sat problems using GRASP, in: D. Du, J. Gu, P.M. Pardalos, (Eds.), Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, American Mathematical Society, Providence, RI, 1997 Rolland, 1996, An efficient Tabu search procedure for the p-median problem, European Journal of Operational Research, 96, 329, 10.1016/S0377-2217(96)00141-5 K.E. Rosing, Private communication Rosing, 1997, Heuristic concentration: Two stage solution construction, European Journal of Operational Research, 97, 75, 10.1016/S0377-2217(96)00100-2 Rosing, 1998, Heuristic concentration and Tabu search: A head to head comparison, European Journal of Operational Research, 104, 93, 10.1016/S0377-2217(97)00310-X Späth, 1985 N. Thabet, Des algorithmes de génération de colonnes pour le problème de la p-mediane, Master thesis, École des HEC (under direction of P. Hansen), 1998 Voss, 1996, A reverse elimination approach for the p-median problem, Studies in Locational Analysis, 8, 49 Whitaker, 1863, A fast algorithm for the greedy interchange for large-scale clustering and median location problems, INFOR, 21, 95