Evolving heuristically difficult instances of combinatorial problems

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 279-285

  Julstrom, Bryant A ^a  

^a ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Evolving difficult instances; Heuristics; Problem instances; Quadratic knapsack problem

Indexed keywords

COMBINATORIAL PROBLEM; EXACT ALGORITHMS; GREEDY HEURISTICS; PROBLEM INSTANCES; QUADRATIC KNAPSACK PROBLEMS;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; MULTIOBJECTIVE OPTIMIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 72749097643     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569941     Document Type: Conference Paper

References (7)

1. A. Baresel, D. Binkley, M. Harman, and B. Korel. Evolutionary testing in the presence of loop-assigned ags: A testability transformation approach. In Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis, pages 108-118, New York, 2004. ACM Press.
2. A. Billionnet and E. Soutif. Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem. INFORMS Journal on Computing, 16(2):188-197, 2004.
3. A. Caprara, D. Pisinger, and P. Toth. Exact solution of the quadratic knapsack problem. INFORMS Journal on Computing, 11:125-137, 1999.
4. F. Corno, G. Cumani, M. S. Reorda, and G. Squillero. Evolutionary test program induction for microprocessor design verification. In Proceedings of the 11th Asian Test Symposium, pages 368-373, 2002.
5. P. L. Hammer and David J. Rader, Jr. Efficient methods for solving quadratic 0-1 knapsack problems. INFOR, 35(3):170-182, 1997.
6. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, Berlin, 2004.
7. R. P. Pargas, M. J. Harrold, and R. R. Peck. Test-data generation using genetic algorithms. Software Testing, Verification and Reliability, 9:263-282, 1999.