Michel Gendreau, Jean-François Larochelle and Brunilde Sanso
Article (1999)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| Research Center: | GERAD - Research Group in Decision Analysis |
| PolyPublie URL: | https://publications.polymtl.ca/28937/ |
| Journal Title: | Networks (vol. 34, no. 2) |
| Publisher: | Wiley |
| DOI: | 10.1002/(sici)1097-0037(199909)34:2<162::aid-net9>3.0.co;2-9 |
| Official URL: | https://doi.org/10.1002/%28sici%291097-0037%281999... |
| Date Deposited: | 18 Apr 2023 15:22 |
| Last Modified: | 07 Apr 2025 16:22 |
| Cite in APA 7: | Gendreau, M., Larochelle, J.-F., & Sanso, B. (1999). A Tabu Search Heuristic for the Steiner Tree Problem. Networks, 34(2), 162-172. https://doi.org/10.1002/%28sici%291097-0037%28199909%2934%3a2%3c162%3a%3aaid-net9%3e3.0.co%3b2-9 |
|---|---|
Statistics
Dimensions
Repository Staff Only
|
View Item |
