Tabu search with strategic oscillation for the quadratic minimum spanning tree

References

• Assad , A. and Xu , W. 1992 . The quadratic minimum spanning tree problem . Naval Research Logistics , 39 ( 3 ) : 399 – 417 .
   Web of Science ®Google Scholar
• Christofides , N. and Benavent , E. 1989 . An exact algorithm for the quadratic assignment problem . Operations Research , 37 ( 5 ) : 760 – 768 .
   Web of Science ®Google Scholar
• Cordone , R. and Passeri , G. 2008 . Heuristic and exact approaches to the quadratic minimum spanning tree problem . Proceedings of the Seventh Cologne-Twente Workshop on Graphs and Combinatorial Optimization , : 52 – 55 .
   Google Scholar
• Fanjul-Peyroa , L. and Ruiz , R. 2010 . Iterated greedy local search methods for unrelated parallel machine scheduling . European Journal of Operational Research , 207 ( 1 ) : 55 – 69 .
   Web of Science ®Google Scholar
• Gao , J. and Lu , M. 2005 . Fuzzy quadratic minimum spanning tree problem . Applied Mathematics and Computation , 164 ( 3 ) : 773 – 788 .
   Web of Science ®Google Scholar
• García , S. , Molina , D. , Lozano , M. and Herrera , F. 2009 . A study on the use of nonparametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 special session on real parameter optimization . Journal of Heuristics , 15 ( 6 ) : 617 – 644 .
   Web of Science ®Google Scholar
• Glover , F. 1977 . Heuristics for integer programming using surrogate constraints . Decision Sciences , 8 ( 1 ) : 156 – 166 .
   Google Scholar
• Glover , F. and Hao , J. K. 2011 . The case for strategic oscillation . Annals of Operations Research , 183 ( 1 ) : 163 – 173 .
   Web of Science ®Google Scholar
• Glover , F. and Laguna , M. 1997 . Tabu Search , Norwell , MA : Kluwer .
   Google Scholar
• Jacobs , L. W. and Brusco , M. J. 1995 . A local-search heuristic for large set-covering problems . Naval Research Logistics , 42 ( 7 ) : 1129 – 1140 .
   Web of Science ®Google Scholar
• Kruskal , J. B. 2011 . On the shortest spanning subtree of a graph and the traveling salesman problem . Proceedings of the American Mathematical Society , 7 ( 1 ) : 48 – 50 .
   Google Scholar
• Lozano , M. , Molina , D. and García-Martínez , C. 2011 . Iterated greedy algorithm for the maximum diversity problem . European Journal of Operational Research , 214 ( 1 ) : 31 – 38 .
   Web of Science ®Google Scholar
• Nugent , C. E. , Vollman , T. E. and Ruml , J. 1968 . An experimental comparison of techniques for the assignment of facilities to locations . Operations Research , 16 ( 1 ) : 150 – 173 .
   Web of Science ®Google Scholar
• Öncan , T. and Punnen , A. P. 2010 . The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm . Computers and Operations Research , 37 ( 10 ) : 1762 – 1773 .
   Web of Science ®Google Scholar
• Palubeckis , G. 2006 . Iterated tabu search for the unconstrained binary quadratic optimization problem . Informatica , 17 ( 2 ) : 279 – 296 .
   Web of Science ®Google Scholar
• Palubeckis , G. 2007 . Iterated tabu search for the maximum diversity problem . Applied Mathematics and Computation , 189 ( 1 ) : 371 – 383 .
   Web of Science ®Google Scholar
• Palubeckis , G. 2008 . Solving the weighted Max-2-SAT problem with iterated tabu search . Information Technology and Control , 37 ( 4 ) : 275 – 284 .
   Web of Science ®Google Scholar
• Palubeckis , G. 2009 . A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem . Applied Mathematics and Computation , 215 ( 3 ) : 1106 – 1117 .
   Web of Science ®Google Scholar
• Palubeckis , G. , Rubliauskas , D. and Targamadz , A. 2010 . Metaheuristic approaches for the quadratic minimum spanning tree problem . Information Technology and Control , 39 ( 4 ) : 257 – 268 .
   Web of Science ®Google Scholar
• Ruiz , R. and Stützle , T. 2008a . An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives . European Journal of Operational Research , 187 ( 3 ) : 1143 – 1159 .
   Web of Science ®Google Scholar
• Ruiz , R. and Stützle , T. 2008b . A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem . European Journal of Operational Research , 177 ( 3 ) : 2033 – 2049 .
   Web of Science ®Google Scholar
• Soak , S. M. , Corne , D. W. and Ahn , B. H. 2006 . The edge-window-decoder representation for tree-based problems . IEEE Transactions on Evolutionary Computation , 10 ( 2 ) : 124 – 144 .
   Web of Science ®Google Scholar
• Sundar , S. and Singh , A. 2010 . A swarm intelligence approach to the quadratic minimum spanning tree problem . Information Sciences , 180 ( 17 ) : 3182 – 3191 .
   Web of Science ®Google Scholar
• Talbi , E.-G . 2002 . A taxonomy of hybrid metaheuristics . Journal of Heuristics , 8 ( 5 ) : 541 – 564 .
   Web of Science ®Google Scholar
• Xu , W. 1995 . “ On the quadratic minimum spanning tree problem ” . In Proceedings of 1995 Japan-China International Workshops on Information Systems Edited by: Gen , M. and Xu , W. 141 – 148 .
   Google Scholar
• Ying , K. C. 2008 . Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic . International Journal of Advanced Manufacturing Technology , 38 ( 3-4 ) : 348 – 354 .
   Web of Science ®Google Scholar
• Ying , K. C. and Cheng , H. M. 2010 . Dynamic parallel machine scheduling with sequence-dependent setup times using an iterated greedy heuristic . Expert Systems with Applications , 37 ( 4 ) : 2848 – 2852 .
   Web of Science ®Google Scholar
• Zhou , G. and Gen , M. 1998 . An effective genetic algorithm approach to the quadratic minimum spanning tree problem . Computers and Operations Research , 25 ( 3 ) : 229 – 237 .
   Web of Science ®Google Scholar