Data-Mining-Driven Neighborhood Search

References

• Better M., Glover F., Samorani M. Classification by vertical and cutting multi-hyperplane decision tree induction. Decision Support Systems (2010) 48(3):430–436Crossref, Google Scholar
• Boyan J., Buntine W., Jagota A.Statistical Machine Learning for Large-Scale Optimization (2000) 3(Neural Computing Surveys). http://ftp.icsi.berkeley.edu/ftp/pub/ai/jagota/vol3_1.pdfGoogle Scholar
• Chen W.-H., Lin C.-S. A hybrid heuristic to solve a task allocation problem. Comput. Oper. Res. (2000) 27(3):287–303Crossref, Google Scholar
• Domingos P. The role of Occam's razor in knowledge discovery. Data Mining Knowledge Discovery (1999) 3(4):409–425Crossref, Google Scholar
• Ernst A., Jiang H., Krishnamoorthy M. Exact solutions to task allocation problems. Management Sci. (2006) 52(10):1634–1646Link, Google Scholar
• Fawcett T. An introduction to ROC analysis. Pattern Recogn. Lett. (2006) 27(8):861–874Crossref, Google Scholar
• Feo T. A., Resende M. G. C. Greedy randomized adaptive search procedures. J. Global Optim. (1995) 6(2):109–133Crossref, Google Scholar
• Glover F. Improved linear programming models for discriminant analysis. Decision Sci. (1990) 21(4):771–785Crossref, Google Scholar
• Glover F., Kochenberger G. A.Handbook of Metaheuristics (2003) 57(Springer, New York) Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Glover F., Klingman D., Phillips N. V. A network-related nuclear power plant model with an intelligent branch-and-bound solution approach. Ann. Oper. Res. (1989) 21(1):317–331Crossref, Google Scholar
• Glover F., Laguna M., Marti R., Glover F., Kochenberger G. A. Scatter search and path relinking: Advances and applications. Handbook of Metaheuristics (2003) 57(Springer, New York) 1–36Crossref, Google Scholar
• Hadj-Alouane A. B., Bean J. C., Murty K. G. A hybrid genetic/optimization algorithm for a task allocation problem. J. Scheduling (1999) 2(4):189–201Crossref, Google Scholar
• Höhn C., Reeves C. R., Alander J. The crossover landscape for the onemax problem. Proc. 2nd Nordic Workshop Genetic Algorithms Their Appl (1996) (University of Vaasa Press, Vaasa, Finland) 27–43Google Scholar
• Jourdan L., Dhaenens C., Talbi E.-G., Almeida F., Blesa Aguilera M. J., Blum C., Moreno Vega J. M., Pérez Pérez M., Roli A., Sampels M. Using datamining techniques to help metaheuristics: A short survey. Hybrid Metaheuristics, Vol. 4030 (2006) (Springer, Berlin) 57–69Lecture Notes in Computer ScienceCrossref, Google Scholar
• Lusa A., Potts C. N. A variable neighbourhood search algorithm for the constrained task allocation problem. J. Oper. Res. Soc. (2008) 59(6):812–822Crossref, Google Scholar
• Martí R., Campos V., Piñana E. A branch and bound algorithm for the matrix bandwidth minimization. Eur. J. Oper. Res. (2008) 186(2):513–528Crossref, Google Scholar
• Martí R., Laguna M., Glover F., Campos V. Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. (2001) 135(2):450–459Crossref, Google Scholar
• Mladenović N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24(11):1097–1100Crossref, Google Scholar
• Padmanabhan B., Tuzhilin A. On the use of optimization for data mining: Theoretical interactions and eCRM opportunities. Management Sci. (2003) 49(10):1327–1343Link, Google Scholar
• Piñana E., Plana I., Campos V., Martí R. GRASP and path relinking for the matrix bandwidth minimization. Eur. J. Oper. Res. (2004) 153(1):200–210Crossref, Google Scholar
• Santos L. F., Martins S. L., Plastino A. Applications of the DM-GRASP heuristic: A survey. Internat. Trans. Oper. Res. (2008) 15(4):387–416Crossref, Google Scholar
• Witten I. H., Frank E.Data Mining: Practical Machine Learning Tools and Techniques (2005) (Morgan Kaufmann, Amsterdam) Morgan Kaufmann Series in Data Management SystemsGoogle Scholar