"Finding approximate solutions of NP-hard optimization and TSP problems ..."

Suash Deb et al. (2016)

> Home

Details and statistics

DOI: 10.1007/S11227-016-1739-2

access: closed

type: Journal Article

metadata version: 2021-06-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tjs/DebFTWMF16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/DebFTWMF16
Suash Deb, Simon Fong, Zhonghuan Tian, Raymond K. Wong, Sabah Mohammed, Jinan Fiaidhi:
Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm. J. Supercomput. 72(10): 3960-3992 (2016)

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.