Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 21
Number of items: 21
  • Duin, C. W., & Voss, S. (1999). The Pilot Method: a strategy for heuristic repetition with application to the Steiner problem in graphs. Networks, (34), 181-191.
  • Duin, C. W. (1998). Reducing the graphical Steiner problem with a sensitivity test. DIMACS series in discrete mathematics and theoretical computer science, 40, 79-107.
  • Volgenant, A., Duin, C. W., & Marsman, S. (1998). The dynamic predicate stashing copy problem and the Steiner problem in Graphs. AE-report, 5/98.
  • Duin, C. W., & Voss, S. (1997). Efficient path and vertex exchange in Steiner tree algorithms. Networks, 29, 89-105.
  • Duin, C. W., & Volgenant, A. (1997). The parial sum criterion for Steiner trees in graphs and shortest paths. European Journal of Operational Research, 97, 172-182. https://doi.org/10.1016/S0377-2217(96)00113-0
  • Duin, C. W., & Voss, S. (1996). The pilot method; a strategie of heuristic repetition with application to the Steiner problem in graphs. Report AE, 96(20).
  • Compagner, F. A., Duin, C. W., & Volgenant, A. (1996). The edge-disjoint Steiner problem in graphs. Optimization, 36, 153-165.
  • Duin, C. W., & Volgenant, A. (1996). An addendum to the hierarchical network design problem. European Journal of Operational Research, 92, 214-216. https://doi.org/10.1016/0377-2217(96)00016-1
  • Duin, C. W., & Voss, S. (1995). Efficient path and vertex exchange in Steiner tree algorithms. (AE Report; No. 4/95). Unknown Publisher.
  • Duin, C. W., & Volgenant, A. (1995). Minmax Steiner biconnected subgraphs and Steiner bipartition of biconnected graphs. (AE Report; No. 8/95). Unknown Publisher.
Page 2 of 3