Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 46
Number of items: 46
  • Teeninga, A., & Volgenant, A. (2004). Improved heuristics for the Traveling Purchaser Problem. Computers & Operations Research, 31(1), 139-150. https://doi.org/10.1016/S0305-0548(02)00193-4
  • Volgenant, A. (2004). A note on the assignment problem with seniority and job priority constraints. European Journal of Operational Research, 154(1), 330-335. https://doi.org/10.1016/S0377-2217(03)00090-0
  • Volgenant, A. (2004). Solving the k-cardinality assignment problem by transformation. European Journal of Operational Research, 157(2), 322-331. https://doi.org/10.1016/S0377-2217(03)00205-4
  • Volgenant, A., & Duin, C. W. (2004). On Steiner versions of (bi)connectivity in network problems. Graphs and Combinatorics, 20(2), 263-273. https://doi.org/10.1007/s00373-004-0554-3
  • Volgenant, A. (2002). Solving some lexicographic multi-objective combinatorial problems. European Journal of Operational Research, 139, 578-584. https://doi.org/10.1016/S0377-2217(01)00214-4
  • Tesselaar, B., Absil, F., & Volgenant, A. (2001). Clustering in doelvolgalgoritmen van radarsystemen. Kwantitatieve Methoden, 22, 27-49.
  • Duin, C. W., Marsman, S., & Volgenant, A. (2000). The Dynamic Predicate Stashing Copy Problem and the Steiner Problem in Graphs. European Journal of Operational Research, (125), 526-534.
  • Volgenant, A. (2000). A note on splitting of variables in integer programming models. European Journal of Operational Research, (122), 166-172.
  • Volgenant, A. (2000). Solving the k-cardinality assignment problem by transformation. AE-report, (3).
  • Volgenant, A., & Teerhuis, E. (1999). Improved heuristics for the n-job single machined weighted tardiness problem. Computers & Operations Research, (26), 35-44.
Page 2 of 5