Measuring instance difficulty for combinatorial optimization problems

Computers and Operations Research

Volumn 39, Issue 5, 2012, Pages 875-889

  Smith Miles, Kate ^a   Lopes, Leo ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

Algorithm selection; Assignment problem; Bin packing; Combinatorial optimization; Graph coloring; Hardness prediction; Instance difficulty; Knapsack problem; Landscape analysis; Phase transition; Timetabling; Traveling salesman problem

Indexed keywords

ALGORITHM SELECTION; ASSIGNMENT PROBLEMS; BIN-PACKING; GRAPH COLORINGS; HARDNESS PREDICTION; INSTANCE DIFFICULTY; KNAPSACK PROBLEMS; LANDSCAPE ANALYSIS; TIMETABLING; TRAVELING SALESMAN;

BINS; COMBINATORIAL OPTIMIZATION; DATA MINING; GRAPH THEORY; HARDNESS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING;

TRAVELING SALESMAN PROBLEM;

EID: 80052260522     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.07.006     Document Type: Review

References (158)

1. D. Achlioptas, A. Naor, and Y. Peres Rigorous location of phase transitions in hard optimization problems Nature 435 7043 2005 759 764 (Pubitemid 40839720)
2. S. Ali, and K.A. Smith On learning algorithm selection for classification Applied Soft Computing Journal 6 2 2006 119 138 (Pubitemid 43069236)
3. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy Efficient testing of large graphs Combinatorica 20 4 2000 451 476
4. N. Alon, E. Fischer, I. Newman, and A. Shapira A combinatorial characterization of the testable graph properties: its all about regularity Proceedings of the 38th annual ACM symposium on theory of computing 2006 ACM New York, NY, USA 251 260 (Pubitemid 44306559)
5. E. Angel, and V. Zissimopoulos On the classification of NP-complete problems in terms of their correlation coefficient Discrete Applied Mathematics 99 13 2000 261 277
6. E. Angel, and V. Zissimopoulos On the hardness of the quadratic assignment problem with metaheuristics Journal of Heuristics 8 4 2002 399 414 (Pubitemid 34691603)
7. K. Anstreicher, N. Brixius, J.P. Goux, and J. Linderoth Solving large quadratic assignment problems on computational grids Mathematical Programming 91 3 2002 563 588 (Pubitemid 44773351)
8. K.M. Anstreicher, and N.W. Brixius A new bound for the quadratic assignment problem based on convex quadratic programming Mathematical Programming 89 3 2001 341 357 (Pubitemid 33758487)
9. D. Avis A note on some computationally difficult set covering problems Mathematical Programming 18 1 1980 138 145
10. Bachelet V. Métaheuristiques parallèles hybrides: application au problème daffectation quadratique. PhD thesis, Universite des Sciences et Technologies de Lille; 1999.
11. E. Balas, and E. Zemel An algorithm for large zeroone knapsack problems Operations Research 1980 1130 1154
12. R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende, and W.R. Stewart Designing and reporting on computational experiments with heuristic methods Journal of Heuristics 1 1 1995 9 32
13. W. Barthel, and A.K. Hartmann Clustering analysis of the ground-state structure of the vertex-cover problem Physical Review E 70 6 2004 66120
14. R. Battiti Reactive self-search: toward tuning heuristics Modern heuristic search methods 1996 61 83
15. R. Battiti, and M. Protasi Reactive local search for the maximum clique problem 1 Algorithmica 29 4 2001 610 637 (Pubitemid 33710626)
16. J.E. Beasley OR-library: distributing test problems by electronic mail Journal of the Operational Research Society 1990 1069 1072
17. Beyrouthy C, Burke EK, McCollum B, McMullan P, Parkes AJ. Enrollment generators, clustering and chromatic numbers. In: Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT 2008), Montreal, Canada; 2008.
18. C. Bierwirth, D.C. Mattfeld, and J.P. Watson Landscape regularity and random walks for the job-shop scheduling problem Lecture notes in computer science vol. 3004 2004 21 30
19. M. Birattari, P. Balaprakash, and M. Dorigo The ACO/F-RACE algorithm for combinatorial optimization under uncertainty Metaheuristics-progress in complex systems optimization. Operations research/computer science interfaces series 2006 Springer Verlag Berlin, Germany 189 203
20. B. Bollobas Modern graph theory 1998 Springer Verlag
21. I.M. Bomze Evolution towards the maximum clique Journal of Global Optimization 10 2 1997 143 164 (Pubitemid 127502309)
22. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo The maximum clique problem Handbook of combinatorial optimization vol. 4(1) 1999 1 74
23. Y. Borenstein, and R. Poli Kolmogorov complexity, optimization and hardness IEEE congress on evolutionary computation, 2006. CEC 2006 2006 112 119 (Pubitemid 47130486)
24. G. Boukeas, C. Halatsis, V. Zissimopoulos, and P. Stamatopoulos Measures of intrinsic hardness for constraint satisfaction problem instances Lecture notes in computer science vol. 2932 2004 184 195 (Pubitemid 38203457)
25. A. Brandstädt, and J.P. Spinrad Graph classes: a survey 1999 Society for Industrial Mathematics
26. P.B. Brazdil, C. Soares, and J.P. Da Costa Ranking learning algorithms: using IBL and meta-learning on accuracy and time results Machine Learning 50 3 2003 251 277
27. S. Burer, and D. Vandenbussche Solving lift-and-project relaxations of binary integer programs SIAM Journal on Optimization 16 3 2006 726 750 (Pubitemid 44231147)
28. E. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg Hyper-heuristics: an emerging direction in modern search technology International series in operations research and management science 2003 457 474
29. M.C. Cario, J.J. Clifford, R.R. Hill, I. Yang, K. Yang, and C.H. Reilly An investigation of the relationship between problem characteristics and algorithm performance: a case study of the GAP IIE Transactions 34 3 2002 297 312 (Pubitemid 34138527)
30. P. Cheeseman, B. Kanefsky, and W.M. Taylor Where the really hard problems are Proceedings of the 12th IJCAI 1991 331 337
31. Chiarandini M, Stutzle T. Experimental evaluation of course timetabling algorithms. Technical Report, Technical Report AIDA-02-05, FG Intellektik, TU Darmstadt; 2002.
32. Y.K. Cho, J.T. Moore, R.R. Hill, and C.H. Reilly Exploiting empirical knowledge for bi-dimensional knapsack problem heuristics International Journal of Industrial and Systems Engineering 3 5 2008 530 548 (Pubitemid 351728708)
33. Christofides N. Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report, Report 388, Graduate School of Industrial Administration, Carnegie Mellon University; 1976.
34. C.S. Chung, M.S. Hung, and W.O. Rom A hard knapsack problem Naval Research Logistics 35 1 1988
35. F.R.K. Chung Spectral graph theory 1997 American Mathematical Society
36. V. Chvatal Hard knapsack problems Operations Research 1980 1402 1411
37. S.H. Clearwater, and T. Hogg Problem structure heuristics and scaling behavior for genetic algorithms Artificial Intelligence 81 12 1996 327 347 (Pubitemid 126349560)
38. E.G. Coffman Jr, M.R. Garey, and D.S. Johnson Approximation algorithms for bin packing: a survey Approximation algorithms for NP-hard problems 1996 PWS Publishing Co. 46 93 ISBN 0534949681
39. D.W. Corne, and A.P. Reynolds Optimisation and generalisation: footprints in instance space Proceedings of the 11th international conference on parallel problem solving from nature: part I 2010 Springer-Verlag 22 31 ISBN 3642158439
40. P. Crescenzi, and V. Kann Approximation on the web: a compendium of NP optimization problems Randomization and Approximation Techniques in Computer Science 1997 111 118
41. J.C. Culberson On the futility of blind search: an algorithmic view of no free lunch Evolutionary Computation 6 2 1998 109 127 (Pubitemid 128692899)
42. J.C. Culberson, and F. Luo Exploring the k-colorable landscape with iterated greedy Cliques, coloring, and satisfiability: second DIMACS implementation challenge, October 1113, 1993 1996 245
43. D. de Werra An introduction to timetabling European Journal of Operational Research 19 2 1985 151 162
44. K. Deb Jr Multi-objective genetic algorithms: problem difficulties and construction of test problems Evolutionary Computation 7 3 1999 205 230
45. Z. Drezner, P.M. Hahn, and É.D. Taillard Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods Annals of Operations Research 139 1 2005 65 94 (Pubitemid 41361095)
46. A.E. Eiben, J.K. Van Der Hauw, and J.I. Van Hemert Graph coloring with adaptive evolutionary algorithms Journal of Heuristics 4 1 1998 25 46 (Pubitemid 128512786)
47. P. Erds, and A. Rényi On random graphs I Publicationes Mathematicae Debrecen 6 1959 290 297
48. E. Falkenauer Tapping the full power of genetic algorithm through suitable representation and local optimization: application to bin packing Evolutionary Algorithms in Management Applications 1995 167 182
49. A. Frieze, and G.B. Sorkin The probabilistic relationship between the assignment and asymmetric traveling salesman problems Proceedings of the 12th annual ACMSIAM symposium on discrete algorithms 2001 Society for Industrial and Applied Mathematics Philadelphia, PA, USA 652 660
50. D.R. Fulkerson, L.E. Trotter, and G.L. Nemhouser Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems Mathematical Programming Study 2 1974 72 84
51. M. Gagliolo, and J. Schmidhuber Learning dynamic algorithm portfolios Annals of Mathematics and Artificial Intelligence 47 3 2006 295 328
52. I.P. Gent Heuristic solution of open bin packing problems Journal of Heuristics 3 4 1998 299 304 (Pubitemid 128514121)
53. I.P. Gent, and T. Walsh Phase transitions from real computational problems Proceedings of the 8th international symposium on artificial intelligence 1995
54. I.P. Gent, and T. Walsh The TSP phase transition Artificial Intelligence 88 12 1996 349 358 (Pubitemid 126371546)
55. Ghosh D, Tathagata B, Ghosh D, Tathagata B. Spotting difficult weakly correlated binary knapsack problems. Technical Report, Indian Institute of Management Ahmedabad, (IIMA) Working Papers 2006-01-04; 2006.
56. D.E. Goldberg Genetic algorithms in search and optimization 1989
57. O. Goldreich Combinatorial property testing (a survey) Randomization methods in algorithm design: DIMACS Workshop, December 1214, 1997 1998 American Mathematical Society 45
58. O. Goldreich, and D. Ron Property testing in bounded degree graphs Algorithmica 32 2 2008 302 343
59. C.P. Gomes, and B. Selman Algorithm portfolio design: theory vs. practice Proceedings of UAI-97 1997 190 197
60. C. Gotsman On graph partitioning, spectral analysis, and digital mesh processing Proceedings of the shape modeling international 2003 165
61. R. Gras How efficient are genetic algorithms to solve high epistasis deceptive problems? IEEE congress on evolutionary computation, 2008. CEC 2008. (IEEE world congress on computational intelligence) 2008 242 249
62. J.L. Gross, and J. Yellen Graph theory and its applications 2006 CRC Press
63. I. Guyon, and A. Elisseeff An introduction to variable and feature selection The Journal of Machine Learning Research 3 2003 1157 1182
64. N.G. Hall, and M.E. Posner Generating experimental data for computational testing with machine scheduling applications Operations Research 2001 854 865 (Pubitemid 34271873)
65. N.G. Hall, and M.E. Posner Performance prediction and preselection for optimization and heuristic solution procedures Operations Research 55 4 2007 703
66. A.K. Hartmann, and M. Weigt Statistical mechanics of the vertex-cover problem Journal of Physics A - Mathematical and General 36 43 2003 11069 11094
67. A.K. Hartmann, and M. Weigt Phase transitions in combinatorial optimization problems: basics, algorithms and statistical mechanics 2005 VCH Verlagsgesellschaft Mbh
68. R.R. Hill, and C.H. Reilly The effects of coefficient correlation structure in two-dimensional knapsack problems on solution procedure performance Management Science 2000 302 317 (Pubitemid 30594354)
69. J.N. Hooker Testing heuristics: we have it all wrong Journal of Heuristics 1 1 1995 33 42
70. H.H. Hoos, and T. Stutzle Towards a characterisation of the behaviour of stochastic local search algorithms for SAT Artificial Intelligence 112 12 1999 213 232 (Pubitemid 32079891)
71. E. Horvitz, Y. Ruan, C. Gomes, H. Kautz, B. Selman, and M. Chickering A Bayesian approach to tackling hard computational problems Proceedings the 17th conference on uncertainty in artificial intelligence (UAI-2001) vol. 216 2001
72. F. Hutter, H.H. Hoos, K. Leyton-Brown, and K.P. Murphy An experimental investigation of model-based parameter optimisation: SPO and beyond Proceedings of the 11th annual conference on genetic and evolutionary computation 2009 ACM 271 278
73. F. Hutter, H.H. Hoos, K. Leyton-Brown, and T. Stuetzle ParamILS: an automatic algorithm configuration framework Journal of Artificial Intelligence Research 36 1 2009 267 306
74. D. Johnson, G. Gutin, L. McGeoch, A. Yeo, W. Zhang, and A. Zverovitch Experimental analysis of heuristics for the ATSP The traveling salesman problem and its variations 2004 p. 44587
75. T. Jones, and S. Forrest Fitness distance correlation as a measure of problem difficulty for genetic algorithms Proceedings of the 6th international conference on genetic algorithms 1995
76. P. Kilby, J. Slaney, and T. Walsh The backbone of the travelling sales person International joint conference on artificial intelligence vol. 19 2005 175
77. J. Knowles, and D. Corne Towards landscape analyses to inform the design of a hybrid local search for the multiobjective quadratic assignment problem Soft computing systems: design, management and applications, vol. 12 2002 p. 2719
78. Komlos J, Simonovits M. Szemerédis regularity lemma and its applications in graph theory. Technical Report, Center for Discrete Mathematics & Theoretical Computer Science; 1995.
79. P. Kostuch, and K. Socha Hardness prediction for the university course timetabling problem Lecture notes in computer science vol. 3004 2004 135 144
80. F. Krza̧kaŁa, A. Pagnani, and M. Weigt Threshold values stability analysis and high-q asymptotics for the coloring problem on random graphs Physical Review E 70 4 2004 46705
81. Kulanoot A. Algorithms for some hard knapsack problems. PhD thesis, Curtin University of Technology; 2000.
82. E.L. Lawler The quadratic assignment problem Management Science 1963 586 599
83. R. Lewis, and B. Paechter Application of the grouping genetic algorithm to university course timetabling Lecture notes in computer science vol. 3448 2005 144 153 (Pubitemid 41273996)
84. K. Leyton-Brown, E. Nudelman, and Y. Shoham Learning the empirical hardness of optimization problems: the case of combinatorial auctions Lecture notes in computer science vol. 2470 2002 556 572
85. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham A portfolio approach to algorithm selection International joint conference on artificial intelligence vol. 18 2003 1542 1543
86. S. Lin, and B.W. Kernighan An efficient heuristic algorithm for the traveling salesman problem Operations Research 21 2 1973
87. M. Locatelli, and G.R. Wood Objective function features providing barriers to rapid global optimization Journal of Global Optimization 31 4 2005 549 565 (Pubitemid 40963398)
88. Lopes L, Smith-Miles KA. Generating applicable synthetic instances for branch problems. Operations Research, under review.
89. W.G. Macready, and D.H. Wolpert What makes an optimization problem hard Complexity 5 1996 40 46
90. N.M. Maia de Abreu, P.O.B. Netto, T.M. Querido, and E.F. Gouvea Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach Discrete Applied Mathematics 124 13 2002 103 116
91. O. Maron, and A.W. Moore The racing algorithm: model selection for lazy learners Artificial Intelligence Review 11 1 1997 193 225 (Pubitemid 127508239)
92. S. Martello, D. Pisinger, and P. Toth Dynamic programming and strong bounds for the 01 knapsack problem Management Science 1999 414 424
93. B. McCollum, A. Schaerf, B. Paechter, P. McMullan, R. Lewis, and A.J. Parkes Setting the research agenda in automated timetabling: the second international timetabling competition INFORMS Journal on Computing 22 1 2010 120 130
94. P. Merz Advanced fitness landscape analysis and the performance of memetic algorithms Evolutionary Computation 12 3 2004 303 325 (Pubitemid 39219650)
95. P. Merz, and B. Freisleben Fitness landscape analysis and memetic algorithms for the quadratic assignment problem IEEE Transactions on Evolutionary Computation 4 4 2000 337 352 (Pubitemid 32075186)
96. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky Determining computational complexity from characteristicphase transitions Nature 400 6740 1999 133 137 ISSN 0028-0836 (Pubitemid 29327535)
97. E. Nudelman, K. Leyton-Brown, H.H. Hoos, A. Devkar, and Y. Shoham Understanding random SAT: beyond the clauses-to-variables ratio Lecture notes in computer science vol. 3258 2004 438 452
98. G. Oshikiri Cheeger constant and connectivity of graphs Interdisciplinary Information Sciences 8 2 2002 147 150
99. J. Ou Edge cuts leaving components of order at least m Discrete Mathematics 305 13 2005 365 371 (Pubitemid 41745582)
100. C.H. Papadimitriou, and K. Steiglitz Some examples of difficult traveling salesman problems Operations Research 1978 434 443
101. B. Pfahringer, H. Bensusan, and C.G. Giraud-Carrier Meta-learning by landmarking various learning algorithms Proceedings of the 17th international conference on machine learning table of contents 2000 Morgan Kaufmann Publishers Inc. San Francisco, CA, USA 743 750
102. D. Pisinger Where are the hard knapsack problems? Computers and Operations Research 32 9 2005 2271 2284 (Pubitemid 40114315)
103. J. Povh, and F. Rendl Compositive and semidefinite relaxations of the quadratic assignment problem Discrete Optimization 6 3 2009 231 241
104. P. Pudil, J. Novovičová, and J. Kittler Floating search methods in feature selection Pattern Recognition Letters 15 11 1994 1119 1125 ISSN 0167-8655
105. R.J. Quick, V.J. Rayward-Smith, and G.D. Smith Fitness distance correlation and ridge functions Lecture notes in computer science 1998 77 86 (Pubitemid 128145939)
106. K.G. Ramakrishnan, M. Resende, B. Ramachandran, and J.F. Pekny Tight QAP bounds via linear programming Series on Applied Mathematics 14 2002 297 304
107. N. Ramakrishnan, J.R. Rice, and E.N. Houstis GAUSS: an online algorithm selection system for numerical quadrature Advances in Engineering Software 33 1 2002 27 36 (Pubitemid 33143521)
108. C.R. Reeves Landscapes, operators and heuristic search Annals of Operations Research 86 1999 473 490
109. C.H. Reilly Synthetic optimization problem generation: show us the correlations INFORMS Journal on Computing 21 3 2009 458 467 ISSN 1526-5528. doi: http://dx.doi.org/10.1287/ijoc.1090.0330
110. J.R. Rice The algorithm selection problem Advances in Computers 1976 65 118
111. J.R. Rice Methodology for the algorithm selection problem Performance evaluation of numerical software: proceedings of the IFIP tc 2.5 working conference on performance evaluation of numerical software vol. 301 1979 North-Holland
112. E. Ridge, and D. Kudenko An analysis of problem difficulty for a class of optimisation heuristics Lecture notes in computer science vol. 4446 2007 198
113. D. Ron Property testing Combinatorial Optimization 9 2 2001 597 643
114. H. Rose, W. Ebeling, and T. Asselmeyer The density of states - a measure of the difficulty of optimisation problems Parallel problem solving from nature - PPSN IV: international conference on evolutionary computation, the 4th international conference on parallel problem solving from nature, Berlin, Germany, September 2226, 1996: proceedings 1996 Springer Verlag 208
115. P. Ross, D. Corne, and H. Terashima-Marín The phase-transition niche for evolutionary algorithms in timetabling Practice and theory of automated timetabling: first international conference, Edinburgh, UK, August 29Septmber 1, 1995: selected papers 1996 Springer Verlag 309
116. P. Ross, E. Hart, and D. Corne Some observations about GA-based exam timetabling Lecture notes in computer science vol. 1408 1997 115 129
117. P. Ross, J.G. Marin-Blazquez, S. Schulenburg, and E. Hart Learning a procedure that can solve hard bin-packing problems: a new ga-based approach to hyper-heuristics Lecture notes in computer science 2003 1295 1306
118. O. Rossi-Doria, M. Sampels, M. Birattari, M. Chiarandini, M. Dorigo, and L.M. Gambardella A comparison of the performance of different metaheuristics on the timetabling problem Lecture notes in computer science 2003 329 354 (Pubitemid 37095598)
119. H. Samulowitz, and R. Memisevic Learning to solve QBF Proceedings of the national conference on artificial intelligence vol. 22 1999 AAAI Press, MIT Press Menlo Park, CA, Cambridge, MA, London 255 [2007]
120. A. Sassano On the facial structure of the set covering polytope Mathematical Programming 44 1 1989 181 202
121. T. Schiavinotto, and T. Stützle A review of metrics on permutations for search landscape analysis Computers & Operations Research 34 10 2007 3143 3153 ISSN 0305-0548 (Pubitemid 46356742)
122. P. Schwerin, and G. Wascher The bin-packing problem: a problem generator and some numerical experiments with FFD packing and MTP International Transactions in Operational Research 4 56 1997 377 389
123. B. Selman, D.G. Mitchell, and H.J. Levesque Generating hard satisfiability problems Artificial Intelligence 81 12 1996 17 29 (Pubitemid 126349547)
124. J. Slaney, and T. Walsh Backbones in optimization and approximation International joint conference on artificial intelligence vol. 17 2001 254 259
125. K. Smith An argument for abandoning the travelling salesman problem as aneural-network benchmark IEEE Transactions on Neural Networks 7 6 1996 1542 1544 (Pubitemid 126780499)
126. Smith-Miles KA, van Hemert J. Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence, doi: 10.1007/s10472-011-9230-5; published online 19th April 2011.
127. K.A. Smith-Miles Cross-disciplinary perspectives on meta-learning for algorithm selection ACM Computing Surveys 41 1 2008
128. K.A. Smith-Miles Towards insightful algorithm selection for optimisation using meta-learning concepts IEEE international joint conference on neural networks 2008 4118 4124
129. Smith-Miles KA, Lopes L. Generalising algorithm performance in instance space: a timetabling case study. In: Lecture notes in computer science, vol. 6683; 2011. p. 52439.
130. K.A. Smith-Miles, and J. van Hemert Understanding TSP difficulty by learning from evolved instances Lecture notes in computer science vol. 6073 2010 266 280
131. K.A. Smith-Miles, R.J.W. James, J.W. Giffin, and Y. Tu Understanding the relationship between scheduling problem structure and heuristic performance using knowledge discovery Lecture notes in computer science vol. 5851 2009 89 103
132. P.F. Stadler, and W. Schnabl The landscape of the traveling salesman problem Physics Letters A 161 4 1992 337 344
133. M. Streeter, D. Golovin, and S.F. Smith Combining multiple heuristics online Proceedings of the national conference on artificial intelligence vol. 22 1999 AAAI Press, MIT Press Menlo Park, CA, Cambridge, MA, London 1197 [2007]
134. T. Stutzle, and S. Fernandes New benchmark instances for the QAP and the experimental analysis of algorithms Lecture notes in computer science vol. 3004 2004 199 209
135. E.D. Taillard Comparison of iterative searches for the quadratic assignment problem Location Science 3 2 1995 87 105
136. J. Tavares, F.B. Pereira, and E. Costa Multidimensional knapsack problem: a fitness landscape analysis IEEE Transactions on Systems, Man, and Cybernetics, Part B 38 3 2008 604 616 (Pubitemid 351796143)
137. H.M.M. Ten Eikelder, and R.J. Willemen Some complexity aspects of secondary school timetabling problems Proceedings of the 3rd international conference on practice and theory of automated timetabling (PATAT 2000), Lecture Notes in Computer Sciences vol. 2079 2000 18 29
138. S. Thiebaux, J. Slaney, and P. Kilby Estimating the hardness of optimisation ECAI 2000 123 130
139. M. Trick Formulations and reformulations in integer programming Lecture notes in computer science vol. 3524 2005 366 379 (Pubitemid 41422299)
140. Tsymbal A, Pechenizkiy M, Cunningham P. Diversity in ensemble feature selection. Technical Report TCD-CS-2003-44, The University of Dublin; 2003.
141. J.I. van Hemert Property analysis of symmetric travelling salesman problem instances acquired through evolution Proceedings of the European conference on evolutionary computation in combinatorial optimization (EvoCop 2005) 2005 Springer
142. J.I. van Hemert Evolving combinatorial problem instances that are difficult to solve Evolutionary Computation 14 4 2006 433 462
143. J.I. van Hemert, and N.B. Urquhart Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation Lecture notes in computer science vol. 3242 2004 151 160 (Pubitemid 39750216)
144. N. Vasconcelos Feature selection by maximum marginal diversity: optimality and implications for visual recognition 2003 IEEE computer society conference on computer vision and pattern recognition, 2003. Proceedings vol. 1 2003
145. R. Venkatesan, and L. Levin Random instances of a graph coloring problem are hard Proceedings of the 20th annual ACM symposium on theory of computing 1988 ACM New York, NY, USA 217 222
146. R. Vilalta, and Y. Drissi A perspective view and survey of meta-learning Artificial Intelligence Review 18 2 2002 77 95
147. T.E. Vollmann, and E.S. Buffa The facilities layout problem in perspective Management Science 1966 450 468
148. R.A. Watson, G.S. Hornby, and J.B. Pollack Modeling building-block interdependency Lecture notes in computer science 1998 97 108 (Pubitemid 128145941)
149. S. Weerawarana, E.N. Houstis, J.R. Rice, A. Joshi, and C.E. Houstis Pythia: a knowledge-based system to select scientific algorithms ACM Transactions on Mathematical Software 22 4 1996 447 468 ISSN 0098-3500 (Pubitemid 126417393)
150. M. Weigt, and A.K. Hartmann Number of guards needed by a museum: a phase transition in vertex covering of random graphs Physical Review Letters 84 26 2000 6118 6121
151. E.D. Weinberger Local properties of Kauffmans NK model: a tunably rugged energy landscape Physical Review A 44 10 1991 6399 6413
152. D.R. White, and F. Harary The cohesiveness of blocks in social networks: node connectivity and conditional density Sociological Methodology 2001 305 359 (Pubitemid 33584802)
153. D.H. Wolpert, and W.G. Macready No free lunch theorems for optimization IEEE Transactions on Evolutionary Computation 1 1 1997 67 82 (Pubitemid 127771019)
154. B. Xin, J. Chen, and F. Pan Problem difficulty analysis for particle swarm optimization: deception and modality Proceedings of the first ACM/SIGEVO summit on genetic and evolutionary computation 2009 623 630
155. L. Xu, F. Hutter, H.H. Hoos, and K. Leyton-Brown SATzilla-07: the design and analysis of an algorithm portfolio for SAT Lecture notes in computer science vol. 4741 2007 712
156. S.C. Yusta Different metaheuristic strategies to solve the feature selection problem Pattern Recognition Letters 30 5 2009 525 534 ISSN 0167-8655
157. W. Zhang Phase transitions and backbones of the asymmetric traveling salesman problem Journal of Artificial Intelligence Research 21 2004 471 497 (Pubitemid 41525908)
158. W. Zhang, and R.E. Korf A study of complexity transitions on the asymmetric traveling salesman problem Artificial Intelligence 81 12 1996 223 239 (Pubitemid 126349556)