"A learning automata-based heuristic algorithm for solving the minimum ..."

Javad Akbari Torkestani, Mohammad Reza Meybodi (2012)

> Home

Details and statistics

DOI: 10.1007/S11227-010-0484-1

access: closed

type: Journal Article

metadata version: 2020-05-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tjs/TorkestaniM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/TorkestaniM12
Javad Akbari Torkestani, Mohammad Reza Meybodi:
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs. J. Supercomput. 59(2): 1035-1054 (2012)

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.