Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Solving maximum set k-covering problem by an adaptive binary particle ..."

Geng Lin, Jian Guan (2018)

> Home

Details and statistics

DOI: 10.1016/J.KNOSYS.2017.11.028

access: closed

type: Journal Article

metadata version: 2024-04-11

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/kbs/LinG18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kbs/LinG18
Geng Lin, Jian Guan:
Solving maximum set k-covering problem by an adaptive binary particle swarm optimization method. Knowl. Based Syst. 142: 95-107 (2018)

a service of

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.