Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 46
Number of items: 46
  • Volgenant, A. (1999). Lexicographic multi-objective combinatorial problems. AE-report, 99(5).
  • Volgenant, A., & Teerhuis, E. (1999). Improved heuristics for the n-job single machined weighted tardiness problem. Computers & Operations Research, (26), 35-44.
  • Volgenant, A., & Jonker, R. (1999). Linear assignment procedures. European Journal of Operational Research, (116), 233-234.
  • Volgenant, A. (1999). Comments on fast heuristics for protection networks for dynamic routing (Ouveysi and Wirth). Journal of the Operational Research Society, (50), 283.
  • Volgenant, A. (1999). On the assignment problem with seniority and job priority constraints. AE-report, 99.
  • Volgenant, A., & Marsman, S. (1998). Core knapsack problems. Journal of the Operational Research Society, 49, 86-92. https://doi.org/10.1057/palgrave.jors.2600488
  • Volgenant, A. (1998). A note on splitting of variables in integer programming models. AE-report, 4/98.
  • Volgenant, A., Duin, C. W., & Marsman, S. (1998). The dynamic predicate stashing copy problem and the Steiner problem in Graphs. AE-report, 5/98.
  • Volgenant, A., & Jonker, R. (1998). Linear Assignment Procedures. AE-report, 7/98.
  • Volgenant, A., & Beek, W. C. (1997). Competitiesplitsing: Clustering onder nevenvoorwaarden. Kwantitatieve Methoden, 18, 31-45.
Page 3 of 5