Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 46
Number of items: 46
  • 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
  • Volgenant, A. (1997). Well-solved cases of the 2-Peripatetic Salesman Problem. Optimization, 39, 275-293.
  • de Kort, J., & Volgenant, A. (1997). A facet preserving extension of the TSP-polytope. In O. J. Vrieze, W. K. Klein Haneveld, & L. C. M. Kallenberg (Eds.), Ten years LNMB. Ph.D research and graduate courses of the Dutch Network of Operations Research. CWI Tract 122. (pp. 55-62). CWI.
  • Volgenant, A. (1997). [Review of: D.P. Bertsekas, J.N. Tsitsiklis (1996) Neuro-dynamic programming]. Interfaces, 27(6), 143. https://doi.org/10.1287/inte.27.6.140
  • Volgenant, A., & Marsman, S. (1996). A core approach to the 0-1 equality knapsack problem. Report AE, 96(7).
  • Volgenant, A. (1996). [Review of: Z. Drezner (1995) Facility location: a survey of applications and methods]. Interfaces, 26(3), 117. https://doi.org/10.1287/inte.26.3.114
  • Volgenant, A. (1996). The travelling salesman, computational solutions for TSP applications. Optima, 50, 10.
  • Volgenant, A., & Marsman, S. (1996). A core approach to the 0-1 equality knapsack problem. (TI discussion paper; No. 96-143/9). Tinbergen Institute.
  • Compagner, F. A., Duin, C. W., & Volgenant, A. (1996). The edge-disjoint Steiner problem in graphs. Optimization, 36, 153-165.
  • Volgenant, A. (1996). Linear and semi assignment problems: a core oriented approach. Computers & Operations Research, 23, 917-932. https://doi.org/10.1016/0305-0548(96)00010-X
Page 4 of 5