Approximating the ::::epsilon:::: -Efficient Set of an MOP with Stochastic Search Algorithms

Oliver Schütze, Carlos A. Coello Coello, El-Ghazali Talbi. Approximating the ::::epsilon:::: -Efficient Set of an MOP with Stochastic Search Algorithms. In Alexander F. Gelbukh, Angel Fernando Kuri Morales, editors, MICAI 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings. Volume 4827 of Lecture Notes in Computer Science, pages 128-138, Springer, 2007. [doi]

@inproceedings{SchutzeCT07,
  title = {Approximating the ::::epsilon:::: -Efficient Set of an MOP with Stochastic Search Algorithms},
  author = {Oliver Schütze and Carlos A. Coello Coello and El-Ghazali Talbi},
  year = {2007},
  doi = {10.1007/978-3-540-76631-5_13},
  url = {http://dx.doi.org/10.1007/978-3-540-76631-5_13},
  tags = {Epsilon, search},
  researchr = {https://researchr.org/publication/SchutzeCT07},
  cites = {0},
  citedby = {0},
  pages = {128-138},
  booktitle = {MICAI 2007: Advances in Artificial Intelligence, 6th Mexican International Conference on Artificial Intelligence, Aguascalientes, Mexico, November 4-10, 2007, Proceedings},
  editor = {Alexander F. Gelbukh and Angel Fernando Kuri Morales},
  volume = {4827},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-76630-8},
}