Finding Worst-Case Instances, and Lower Bounds, for NP-Complete Problems Using Genetic Algorithms

Johnson, Matthew P.; Kosoresow, A.P.

Finding Worst-Case Instances, and Lower Bounds, for NP-Complete Problems Using Genetic Algorithms (bibtex)

by Matthew P. Johnson, A.P. Kosoresow

Reference:

Finding Worst-Case Instances, and Lower Bounds, for NP-Complete Problems Using Genetic Algorithms (Matthew P. Johnson, A.P. Kosoresow), Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution And Learning, Springer, 2002.

Bibtex Entry:

@article{johnsonkos2,
    author={Matthew P. Johnson and A.P. Kosoresow},
    title={Finding Worst-Case Instances, and Lower Bounds, for NP-Complete Problems
        Using Genetic Algorithms},
    journal={Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution And
        Learning},
    year={2002},
    publisher={Springer}
}