"Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and ..."

Miroslaw Blocho, Jakub Nalepa (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-67792-7_46

access: closed

type: Conference or Workshop Paper

metadata version: 2019-02-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icmmi/BlochoN17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icmmi/BlochoN17
Miroslaw Blocho, Jakub Nalepa:
Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. ICMMI 2017: 471-480

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.