|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 2 of 11 found articles
| Title: |
Approximating a solution of the s–t max-cut problem with a deterministic annealing algorithm |
| Author: |
Dang, Chuangyin |
| Appeared in: |
Neural networks |
| Paging: | Volume 13 (2000) nr. 7 pages 10 p. |
| Year: |
2000 |
| Contents: | |
| Publisher: |
Elsevier Science Ltd |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 2 of 11 found articles
| << previous | next >> |