"A hybrid genetic algorithm for the repetition free longest common ..."

Mauro Castelli, Stefano Beretta, Leonardo Vanneschi (2013)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2013.09.002

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/CastelliBV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/CastelliBV13
Mauro Castelli, Stefano Beretta, Leonardo Vanneschi:
A hybrid genetic algorithm for the repetition free longest common subsequence problem. Oper. Res. Lett. 41(6): 644-649 (2013)

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.