Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 21
Number of items: 21
  • Volgenant, A., & Duin, C. W. (2010). Improved polynomial algorithms for robust bottleneck problems with interval data. Computers & Operations Research, 37(5), 909-915. https://doi.org/10.1016/j.cor.2009.03.013
  • Gong, H., Tang, L., & Duin, C. W. (2010). A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times. Computers & Operations Research, 37(5), 960-969. https://doi.org/10.1016/j.cor.2009.08.001
  • Volgenant, A., & Duin, C. W. (2010). On a pair of job-machine assignment problems with two stages. Computers & Operations Research, 37(2), 334-340. https://doi.org/10.1016/j.cor.2009.05.009
  • Cai, M.-C., Duin, C. W., Yang, X., & Zhang, J. (2008). The partial inverse minimum spanning tree problem when weight increase is forbidden. European Journal of Operational Research, 188(2), 348-353. https://doi.org/10.1016/j.ejor.2007.04.031
  • Duin, C. W., & van der Sluis, E. (2006). On the complexity of Adjacent Resource Scheduling. Journal of Scheduling, 9(1), 49-62. https://doi.org/10.1007/s10951-006-5593-6
  • Duin, C. W., & Volgenant, A. (2006). Some inverse optimization problems under the Hamming distance. European Journal of Operational Research, 170(3), 887-899. https://doi.org/10.1016/j.ejor.2004.07.059
  • 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
  • Open Access
    Duin, C. W., & van der Sluis, E. (2004). On the complexity of adjacent resource scheduling. (Report AE; No. 6/2004). Institute of Actuarial Science & Econometrics. http://www1.feb.uva.nl/pp/bin/333fulltext.pdf
  • 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.
  • Duin, C. W. (2000). Preprocessing the Steiner problem in graph. In D. Du, J. M. Smith, & J. H. Rubinstein (Eds.), Advances in Steiner trees. Series in Combinatorial Optimization (6) (pp. 173-233). Kluwer Academic Publishers.
Page 1 of 3