. Ajouter-une-arête, pour chaque sommet u i ? N (v), (a) entre u ij et u kl

. Le-nouveau-graphe-ainsi-obtenu-est-noté?gnoté?-noté?g, Un exemple de pliage généralisé est donné figure 5.2. La construction peut être vue de manière itérative en parcourant les sommets du voisinage de v suivant l'ordre totale

R. H. Kerr, J. L. Scheidt, A. J. Fontanna, and J. K. Wiley, Unit commitment. Power Apparatus and Systems, IEEE Transactions, issue.5, pp.85417-421, 1966.

M. O. Khemmoudj, M. Porcheron, and H. Bennaceur, When Constraint Programming and Local Search Solve the Scheduling Problem of Electricit?? de France Nuclear Power Plant Outages, Lecture Notes in Computer Science, vol.4204, pp.271-283, 2006.
DOI : 10.1007/11889205_21

N. P. Padhy, Unit commitment-a bibliographical survey. Power Systems, IEEE Transactions on, vol.19, issue.2, pp.1196-1205, 2004.

M. Porcheron, A. Gorge, O. Juan, T. Simovic, and G. Dereu, Challenge roadef/euro 2010 : A large-scale energy management problem with varied constraints

I. J. Raglend and N. P. Padhy, Comparison of practical unit commitment problem solutions . Electric Power Components and Systems, pp.844-863, 2008.

P. A. Ruiz, E. Zak, C. R. Philbrick, and K. W. Cheung, Modeling the unit commitment problem with uncertainty, INFORMS Annual Meeting, 2007.

S. Salam, Unit commitment solution methods a set of vertices S ? V (G) of a graph G is O(|S||E(G)|), as described in [7]. We can relax the constraint of G being bipartite to obtain the following: References [1] Anand Klav?ar and I. Peterin, Convex sets in lexicographic products of graphs, In Proceedings of World Academy of Science, Engineering and Technology Graphs and Combinatorics, vol.26, pp.600-605, 2007.

J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio et al., On the hull number of some graph classes, Theoretical Computer Science, vol.475, 2011.
DOI : 10.1016/j.tcs.2012.12.035
URL : https://hal.archives-ouvertes.fr/inria-00635032

J. Araujo, V. Campos, F. Giroire, L. Sampaio, and R. Soares, On the hull number of some graph classes, Sixth European Conference on Combinatorics, Graph Theory and Applications, pp.49-55, 2011.
DOI : 10.1016/j.tcs.2012.12.035
URL : https://hal.archives-ouvertes.fr/inria-00635032

G. Bacsó and Z. Tuza, Dominating cliques in P5-free graphs, Periodica Mathematica Hungarica, vol.3, issue.4, pp.303-308, 1990.
DOI : 10.1007/BF02352694

J. Cáceres, C. Hernando, M. Mora, I. Pelayo, and M. Puertas, On the geodetic and the hull numbers in strong product graphs, Computers & Mathematics with Applications, vol.60, issue.11, pp.3020-3031, 2010.
DOI : 10.1016/j.camwa.2010.10.001

G. B. Cagaanan, S. R. Canoy, and J. , On the hull sets and hull number of the cartesian product of graphs, Discrete Mathematics, vol.287, issue.1-3, pp.141-144, 2004.
DOI : 10.1016/j.disc.2004.06.014

M. C. Dourado, J. G. Gimbel, J. Kratochvíl, F. Protti, and J. L. Szwarcfiter, On the computation of the hull number of a graph, Discrete Mathematics, vol.309, issue.18, pp.5668-5674, 2006.
DOI : 10.1016/j.disc.2008.04.020

M. C. Dourado, F. Protti, D. Rautenbach, and J. L. Szwarcfiter, On the Hull Number of Triangle-Free Graphs, SIAM Journal on Discrete Mathematics, vol.23, issue.4, pp.2163-2172, 2010.
DOI : 10.1137/090751797

M. G. Everett and S. B. Seidman, The hull number of a graph, Discrete Mathematics, vol.57, issue.3, pp.217-223, 1985.
DOI : 10.1016/0012-365X(85)90174-8

J. Flum and M. Grohe, Parameterized Complexity Theory, Theoretical Computer Science. An EATCS Series, 2006.

R. Ganian, Using neighborhood diversity to solve hard problems, 2012.

M. Lampis, Algorithmic Meta-theorems for Restrictions of Treewidth, Algorithmica, vol.4, issue.3, pp.19-37, 2012.
DOI : 10.1007/s00453-011-9554-x

I. Peterin, The pre-hull number and lexicographic product, Discrete Mathematics, vol.312, issue.14, pp.2153-2157, 2010.
DOI : 10.1016/j.disc.2011.08.031

R. Ahammed, F. , and P. Moscato, Evolving L-Systems as an Intelligent Design Approach to Find Classes of Difficult-to-Solve Traveling Salesman Problem Instances, EvoApplications, pp.1-11, 2011.
DOI : 10.1007/978-3-642-20525-5_1

D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem : A Computational Study, Princeton Series in Applied Mathematics, 2007.

J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio et al., On the hull number of some graph classes, Theoretical Computer Science, vol.475, 2013.
DOI : 10.1016/j.tcs.2012.12.035
URL : https://hal.archives-ouvertes.fr/inria-00635032

J. Araujo, G. Morel, L. Sampaio, R. Soares, and V. Weber, Hull number: -free graphs and reduction rules, Electronic Notes in Discrete Mathematics, vol.44, 2012.
DOI : 10.1016/j.endm.2013.10.011
URL : https://hal.archives-ouvertes.fr/hal-00724120

J. L. Arthur and J. O. Frendewey, Generating Travelling-Salesman Problems with Known Optimal Tours, Journal of the Operational Research Society, vol.39, issue.2, pp.153-159, 1988.
DOI : 10.1057/jors.1988.27

M. Balinski, Integer programming : Methods, uses, computation, Management Science Series A, vol.12, issue.3, pp.253-313, 1965.
DOI : 10.1007/978-3-540-68279-0_6

T. Bartz-beielstein, M. Chiarandini, L. Paquete, and M. Preuss, Experimental Methods for the Analysis of Optimization Algorithms, 2010.
DOI : 10.1007/978-3-642-02538-9

A. Barvinok, E. Gimadi, and A. Serdyukov, The maximum TSP The Traveling Salesman Problem and Its Variations, pp.585-607, 2004.

J. Beardwood, J. H. Halton, and J. M. Hammersley, The shortest path through many points, Mathematical Proceedings of the Cambridge Philosophical Society, vol.21, issue.04, pp.299-327, 1959.
DOI : 10.2307/2031707

M. Bellmore and G. L. Nemhauser, The Traveling Salesman Problem: A Survey, Operations Research, vol.16, issue.3, pp.538-558, 1968.
DOI : 10.1287/opre.16.3.538

T. Berg, On the Complexity of Modified Instances, 2008.

M. Birattari, On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs ?, 2004.

M. Birattari, The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective, 2004.

M. Birattari, M. Zlochin, and M. Dorigo, Towards a theory of practice in??metaheuristics design: A machine learning perspective, Theoretical Informatics and Applications, pp.353-369, 2006.
DOI : 10.1051/ita:2006009

R. M. Brady, Optimization strategies gleaned from biological evolution, Nature, vol.4, issue.6040, pp.804-806, 1985.
DOI : 10.1038/317804a0

J. Branke and C. W. Pickardt, Evolutionary search for difficult problem instances to support the design of job shop dispatching rules, European Journal of Operational Research, vol.212, issue.1, pp.22-32, 2011.
DOI : 10.1016/j.ejor.2011.01.044

K. L. Brown, E. Nudelman, and Y. Shoham, Empirical hardness models, Journal of the ACM, vol.56, issue.4, pp.1-52, 2009.
DOI : 10.1145/1538902.1538906

P. Cheeseman, B. Kanefsky, and W. M. Taylor, Where the really hard problems are, Proceedings of the 12th International Joint Conference on Artificial Intelligence IJCAI'91, pp.331-337, 1991.

N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, 1976.

V. Chvátal, Hard Knapsack Problems, Operations Research, vol.28, issue.6, pp.1402-1411, 1980.
DOI : 10.1287/opre.28.6.1402

G. Clarke and J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Operations Research, vol.12, issue.4, pp.568-581, 1964.
DOI : 10.1287/opre.12.4.568

D. W. Corne and A. P. Reynolds, Optimisation and Generalisation: Footprints in Instance Space, Parallel Problem Solving from Nature, PPSN XI, pp.22-31, 2010.
DOI : 10.1007/978-3-642-15844-5_3

C. Cotta and P. Moscato, A mixed evolutionary-statistical analysis of an algorithm's complexity, Applied Mathematics Letters, vol.16, issue.1, pp.41-47, 2003.
DOI : 10.1016/S0893-9659(02)00142-8

G. A. Croes, A Method for Solving Traveling-Salesman Problems, Operations Research, vol.6, issue.6, pp.791-812, 1958.
DOI : 10.1287/opre.6.6.791

U. Derigs and A. Metz, ??ber die Anwendung optimaler Fractional Matchings zur L??sung des (ganzzahligen) Matching-Problems, Computing, vol.69, issue.3, pp.263-270, 1986.
DOI : 10.1007/BF02240072

M. C. Dourado, J. G. Gimbel, J. Kratochvíl, F. Protti, and J. L. Szwarcfiter, On the computation of the hull number of a graph, Discrete Mathematics, vol.309, issue.18, pp.5668-5674, 2009.
DOI : 10.1016/j.disc.2008.04.020

R. G. Downey and M. R. Fellows, Parameterized Complexity, 1999.
DOI : 10.1007/978-1-4612-0515-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3797

Z. Drezner, P. Hahn, and E. Taillard, Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods, Annals of Operations Research, vol.22, issue.10, pp.65-94, 2005.
DOI : 10.1007/s10479-005-3444-z

C. Ebenegger, P. L. Hammer, and D. De-werra, Pseudo-Boolean Functions and Stability of Graphs, Algebraic and Combinatorial Methods in Operations Research Proceedings of the Workshop on Algebraic Structures in Operations Research, pp.83-97, 1984.
DOI : 10.1016/S0304-0208(08)72955-4

M. G. Everett and S. B. Seidman, The hull number of a graph, Discrete Mathematics, vol.57, issue.3, pp.217-223, 1985.
DOI : 10.1016/0012-365X(85)90174-8

T. Fischer, T. Stützle, H. Hoos, and P. Merz, An analysis of the hardness of TSP instances for two high-performance algorithms, MIC'2005 -6th Metaheuristics International Conference, 2005.

R. Fleischer, X. Wu, and L. Yuan, Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem, Algorithms -ESA 2009, pp.611-622, 2009.
DOI : 10.1007/978-3-642-04128-0_55

J. Flum and M. Grohe, Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series, 2006.

F. V. Fomin, F. Grandoni, and D. Kratsch, Measure and conquer : A simple O(2 0.288n ) independent set algorithm, Proceedings of the 17th annual ACM-SIAM Symposium on Discrete Algorithm, SODA '06, pp.18-25, 2006.
DOI : 10.1145/1109557.1109560

T. Gallai, Über extreme Punkt-und Kantenmengen, Ann. Univ. Sci. Budap . Rolando Eötvös, Sect. Math, vol.2, pp.133-138, 1959.

M. R. Garey and D. S. Johnson, Computers and Intractability : A Guide to the Theory of NP-Completeness, 1979.

I. P. Gent and T. Walsh, Easy problems are sometimes hard, Artificial Intelligence, vol.70, issue.1-2, pp.335-345, 1994.
DOI : 10.1016/0004-3702(94)90109-0

A. Goldberg, Selecting Problems for Algorithm Evaluation, Algorithm Engineering, pp.1-11, 1999.
DOI : 10.1007/3-540-48318-7_1

A. T. Goldberg, On the Complexity of the Satisfiability Problem, 1979.

C. P. Gomes and B. Selman, Algorithm portfolio design : Theory vs. practice, Proceedings of the 13th Conference Annual Conference on Uncertainty in Artificial Intelligence, pp.190-197, 1997.

C. P. Gomes and B. Selman, Algorithm portfolios, Artificial Intelligence, vol.126, issue.1-2, pp.43-62, 2001.
DOI : 10.1016/S0004-3702(00)00081-3

H. J. Greenberg, Computational Testing: Why, How and How Much, ORSA Journal on Computing, vol.2, issue.1, pp.94-97, 1990.
DOI : 10.1287/ijoc.2.1.94

R. Greenberg and H. J. , SOFTWARE SECTION???RANDMOD: A System for Randomizing Modifications to an Instance of a Linear Program, ORSA Journal on Computing, vol.3, issue.2, pp.173-175, 1991.
DOI : 10.1287/ijoc.3.2.173

N. G. Hall and M. E. Posner, Generating Experimental Data for Computational Testing with Machine Scheduling Applications, Operations Research, vol.49, issue.6, pp.854-865, 2001.
DOI : 10.1287/opre.49.6.854.10014

J. Hartmanis, On sparse sets in NP???P, Information Processing Letters, vol.16, issue.2, pp.55-60, 1983.
DOI : 10.1016/0020-0190(83)90024-8

B. P. Hayes, Can't get no satisfaction, American Scientist, vol.85, issue.2, pp.108-112, 1997.

J. N. Hooker, Needed: An Empirical Science of Algorithms, Operations Research, vol.42, issue.2, pp.201-212, 1994.
DOI : 10.1287/opre.42.2.201

J. N. Hooker, Testing heuristics: We have it all wrong, Journal of Heuristics, vol.6, issue.1, pp.33-42, 1995.
DOI : 10.1007/BF02430364
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4103

B. A. Huberman, R. M. Lukose, and T. Hogg, An Economics Approach to Hard Computational Problems, Science, vol.275, issue.5296, pp.51-54, 1997.
DOI : 10.1126/science.275.5296.51

D. S. Johnson, A theoretician's guide to the experimental analysis of algorithms, Data Structures, Near Neighbor Searches, and Methodology : Proceedings of the 5th and 6th DIMACS Challenge Workshop, 2002.

D. S. Johnson and L. A. Mcgeoch, Local Search in Combinatorial Optimization , Chapter The Traveling Salesman Problem : A Case Study in Local Optimization, pp.215-310, 1997.

D. S. Johnson and L. A. Mcgeoch, Experimental analysis of heuristics for the STSP The Traveling Salesman Problem and Its Variations, of Combinatorial Optimization, 2002.

E. L. Johnson, E. D. Spector, A. Goodman, W. B. Wu, H. Langdon et al., Genetic algorithms as algorithm adversaries, Proceedings of the Genetic and Evolutionary Computation Conference, pp.1314-1321, 2001.

B. A. Julstrom, Evolving heuristically difficult instances of combinatorial problems, Proceedings of the 11th Annual conference on Genetic and evolutionary computation, GECCO '09, pp.279-286, 2009.
DOI : 10.1145/1569901.1569941

K. Ko, P. Orponen, U. Schöning, and O. Watanabe, What is a hard instance of a computational problem?, Proceedings of the Conference on Structure in Complexity Theory, pp.197-217, 1986.
DOI : 10.1007/3-540-16486-3_99

Y. Kochetov and D. Ivanenko, Computationally Difficult Instances for the Uncapacitated Facility Location Problem, Metaheuristics : Progress as Real Problem Solvers, pp.351-367, 2005.
DOI : 10.1007/0-387-25383-1_16

A. P. Kosoresow and M. P. Johnson, Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms, AI 2002 : Advances in Artificial Intelligence, pp.344-355, 2002.
DOI : 10.1007/3-540-36187-1_30

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

M. Lampis, Algorithmic Meta-theorems for Restrictions of Treewidth, Algorithmica, vol.4, issue.3, pp.19-37, 2012.
DOI : 10.1007/s00453-011-9554-x

E. L. Lawler, J. K. Lenstra, A. H. Kan, and D. B. Shmoys, The Traveling Salesman Problem, 1985.

K. Leyton-brown, E. Nudelman, G. Andrew, J. Mcfadden, and Y. Shoham, A portfolio approach to algorithm selection, Proceedings of the 8th International Joint Conference on Artificial Intelligence, pp.1542-1542, 2003.

M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and Its Applications, 1997.
DOI : 10.1007/978-0-387-49820-1

P. Liberatore, The complexity of modified instances, 2004.

N. Lynch, On Reducibility to Complex or Sparse Sets, Journal of the ACM, vol.22, issue.3, pp.341-345, 1975.
DOI : 10.1145/321892.321895

M. Marmion, Recherche Locale et Optimisation Combinatoire : de l'Analyse Structurelle d'un Problème à la Conception d'Algorithmes Efficaces, 2011.

C. C. Mcgeoch, Feature Article???Toward an Experimental Method for Algorithm Simulation, INFORMS Journal on Computing, vol.8, issue.1, pp.1-15, 1996.
DOI : 10.1287/ijoc.8.1.1

C. C. Mcgeoch, A Guide to Experimental Algorithmics, 2012.
DOI : 10.1017/CBO9780511843747

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky, Determining computational complexity from characteristic 'phase transitions', Nature, vol.400, pp.133-137, 1999.

P. Moscato and M. G. Norman, On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem, INFORMS Journal on Computing, vol.10, issue.2, pp.121-132, 1998.
DOI : 10.1287/ijoc.10.2.121

R. Niedermeier, Invitation to Fixed-Parameter Algorithms, 2006.
DOI : 10.1093/acprof:oso/9780198566076.001.0001

M. G. Norman and P. Moscato, The euclidean traveling salesman problem and a space-filling curve, Chaos, Solitons & Fractals, vol.6, pp.389-397, 1995.
DOI : 10.1016/0960-0779(95)80046-J

P. Orponen, On the instance complexity of NP-hard problems, Proceedings Fifth Annual Structure in Complexity Theory Conference, pp.20-27, 1990.
DOI : 10.1109/SCT.1990.113951

P. Orponen, K. Ko, U. Schöning, and O. Watanabe, Instance complexity, Journal of the ACM, vol.41, issue.1, pp.96-121, 1994.
DOI : 10.1145/174644.174648

M. A. Osorio and G. Cuaya, Hard Problem Generation for MKP, Sixth Mexican International Conference on Computer Science (ENC'05), pp.290-297, 2005.
DOI : 10.1109/ENC.2005.22

M. A. Osorio and D. Pinto, Hard and easy to solve TSP instances, XXX Aniversario del Programa Educativo de Computación, BUAP, pp.26-30, 2003.

C. H. Papadimitriou, Computational Complexity, 1994.

C. H. Papadimitriou and K. Steiglitz, Some Examples of Difficult Traveling Salesman Problems, Operations Research, vol.26, issue.3, pp.434-443, 1978.
DOI : 10.1287/opre.26.3.434

D. Pisinger, Where are the hard knapsack problems?, Computers & Operations Research, vol.32, issue.9, pp.2271-2284, 2005.
DOI : 10.1016/j.cor.2004.03.002

E. Pitzer and M. Affenzeller, A Comprehensive Survey on Fitness Landscape Analysis, Recent Advances in Intelligent Engineering Systems of Studies in Computational Intelligence, 2012.
DOI : 10.1007/978-3-642-23229-9_8

M. Porta and B. A. Julstrom, Evolving instances of unconstrained binary quadratic programming that challenge a tabu search heuristic, Proceedings of the fourteenth international conference on Genetic and evolutionary computation conference companion, GECCO Companion '12, pp.639-640, 2012.
DOI : 10.1145/2330784.2330898

R. L. Rardin and R. Uzsoy, Experimental evaluation of heuristic optimization algorithms : A tutorial, Journal of Heuristics, vol.7, issue.3, pp.261-304, 2001.
DOI : 10.1023/A:1011319115230

G. Reinelt, TSPLIB???A Traveling Salesman Problem Library, ORSA Journal on Computing, vol.3, issue.4, pp.376-384, 1991.
DOI : 10.1287/ijoc.3.4.376

J. R. Rice, The Algorithm Selection Problem, Advances in Computers, vol.15, pp.65-118, 1976.
DOI : 10.1016/S0065-2458(08)60520-3

E. Ridge and D. Kudenko, An Analysis of Problem Difficulty for a Class of Optimisation Heuristics, Proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP'07, pp.198-209, 2007.
DOI : 10.1007/978-3-540-71615-0_18

E. Ridge and D. Kudenko, Determining Whether a Problem Characteristic Affects Heuristic Performance, Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp.21-35, 2008.
DOI : 10.1007/978-3-540-70807-0_2

D. J. Rosenkrantz, R. E. Stearns, P. M. Lewis, and I. , An Analysis of Several Heuristics for the Traveling Salesman Problem, SIAM Journal on Computing, vol.6, issue.3, pp.563-581, 1977.
DOI : 10.1137/0206041

E. M. Rudnick, J. H. Patel, G. S. Greenstein, and T. M. Niermann, Sequential circuit test generation in a genetic algorithm framework, Proceedings of the 31st annual conference on Design automation conference , DAC '94, pp.698-704, 1994.
DOI : 10.1145/196244.196619

D. G. Saab, Y. G. Saab, and J. A. Abraham, CRIS: A test cultivation program for sequential VLSI circuits, IEEE/ACM International Conference on Computer-Aided Design, pp.216-219, 1992.
DOI : 10.1109/ICCAD.1992.279372

R. Santana, A. Mendiburu, and J. A. Lozano, Using network mesures to test evolved NK-landscapes, 2012.

E. R. Scheinerman and D. H. Ullman, Fractional Graph Theory : A Rational Approach to the Theory of Graphs, 1997.

T. Schiavinotto and T. Stützle, The linear ordering problem: Instances, search space analysis and algorithms, Journal of Mathematical Modelling and Algorithms, vol.63, issue.(5), pp.367-402, 2004.
DOI : 10.1007/s10852-005-2583-1

U. Schöning, Complexity cores and hard problem instances, Proceedings of the International Symposium on Algorithms, SIGAL '90, pp.232-240, 1990.
DOI : 10.1007/3-540-52921-7_72

A. Schrijver, Combinatorial Optimization : Polyhedra and Efficiency, 2003.

B. Selman, D. G. Mitchell, and H. J. Levesque, Generating hard satisfiability problems, Artificial Intelligence, vol.81, issue.1-2, pp.17-29, 1996.
DOI : 10.1016/0004-3702(95)00045-3
URL : http://doi.org/10.1016/0004-3702(95)00045-3

K. Smith-miles and L. Lopes, Measuring instance difficulty for combinatorial optimization problems, Computers & Operations Research, vol.39, issue.5, pp.875-889, 2012.
DOI : 10.1016/j.cor.2011.07.006

K. Smith-miles and J. I. Van-hemert, Discovering the suitability of optimisation algorithms by learning from evolved instances, Annals of Mathematics and Artificial Intelligence, vol.81, issue.1???2, pp.87-104, 2011.
DOI : 10.1007/s10472-011-9230-5

K. Smith-miles, J. I. Van-hemert, and X. Y. Lim, Understanding TSP Difficulty by Learning from Evolved Instances, Learning and Intelligent Optimization, pp.266-280, 2010.
DOI : 10.1007/978-3-642-13800-3_29

M. Srinivas and L. M. Patnaik, A Simulation-Based Test Generation Scheme Using Genetic Algorithms, The Sixth International Conference on VLSI Design, pp.132-135, 1993.
DOI : 10.1109/ICVD.1993.669663

T. Stützle and S. Fernandes, New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms, Evolutionary Computation in Combinatorial Optimization, pp.199-209, 2004.
DOI : 10.1007/978-3-540-24652-7_20

J. W. Tukey, Exploratory Data Analysis Evolving binary constraint satisfaction problem instances that are difficult to solve, CEC '03, pp.1267-1273, 1977.

J. I. Van-hemert, Property analysis of symmetric travelling salesman problem instances acquired through evolution Evolving combinatorial problem instances that are difficult to solve, Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization, Evo- COP'05, pp.122-131, 2005.

J. I. Van-hemert, N. B. Urquhart, X. Yao, E. K. Burke, J. A. Lozano et al., Phase Transition Properties of Clustered Travelling Salesman Problem Instances Generated with Evolutionary Computation, Parallel Problem Solving from Nature -PPSN VIII of Lecture Notes in Computer Science, pp.151-160, 2004.
DOI : 10.1007/978-3-540-30217-9_16

B. Vandegriend and J. C. Culberson, The G n,m phase transition is not hard for the hamiltonian cycle problem, Journal of Artificial Intelligence Research, vol.9, pp.219-245, 1998.

J. Wegener, H. Sthamer, B. F. Jones, and D. E. Eyres, Testing real-time systems using genetic algorithms, Software Quality Control, vol.6, issue.2, pp.127-135, 1997.
DOI : 10.1023/A:1018551716639

E. Weinberger, Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics, vol.1, issue.5, pp.325-336, 1990.
DOI : 10.1007/BF00202749

T. Weise, M. Zapf, R. Chiong, and A. J. Nebro, Why Is Optimization Difficult?, Nature-Inspired Algorithms for Optimisation, pp.1-50, 2009.
DOI : 10.1007/978-3-642-00267-0_1

C. P. Williams and T. Hogg, Using deep structure to locate hard problems, Proceedings of the 10th National Conference on Artificial intelligence , AAAI'92, pp.472-477, 1992.

S. Wright, The roles of mutation, inbreeding, crossbreeding, and selection in evolution, Proceedings of the 6th International Congress of Genetics, pp.356-366, 1932.

L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-brown, SATzilla : Portfoliobased algorithm selection for SAT, Journal of Artificial Intelligence Research, vol.32, issue.1, pp.565-606, 2008.

E. Zemel, Measuring the Quality of Approximate Solutions to Zero-One Programming Problems, Mathematics of Operations Research, vol.6, issue.3, pp.319-332, 1981.
DOI : 10.1287/moor.6.3.319