"A Deterministic Alternative to Competent Genetic Algorithms That ..."

Manuel Valenzuela-Rendón, Horacio Martinez-Alfaro, Hugo Terashima-Marín (2005)

> Home

Details and statistics

DOI: 10.1007/11579427_70

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/micai/Valenzuela-RendonMT05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/micai/Valenzuela-RendonMT05
Manuel Valenzuela-Rendón, Horacio Martinez-Alfaro, Hugo Terashima-Marín:
A Deterministic Alternative to Competent Genetic Algorithms That Solves to Optimality Linearly Decomposable Non-overlapping Problems in Polynomial Time. MICAI 2005: 692-701

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.