Citation: Wfj. Verhaegh et Ehl. Aarts, A POLYNOMIAL-TIME ALGORITHM FOR KNAPSACK WITH DIVISIBLE ITEM SIZES, Information processing letters, 62(4), 1997, pp. 217-221
Citation: Wpm. Nuijten et Ehl. Aarts, A COMPUTATIONAL STUDY OF CONSTRAINT SATISFACTION FOR MULTIPLE CAPACITATED JOB-SHOP SCHEDULING, European journal of operational research, 90(2), 1996, pp. 269-284
Authors:
DEFLUITER B
AARTS EHL
KORST JHM
VERHAEGH WFJ
VANDERWERF A
Citation: B. Defluiter et al., THE COMPLEXITY OF GENERALIZED RETIMING PROBLEMS, IEEE transactions on computer-aided design of integrated circuits and systems, 15(11), 1996, pp. 1340-1353
Authors:
VERHAEGH WFJ
LIPPENS PER
AARTS EHL
KORST JHM
VANMEERBERGEN JL
VANDERWERF A
Citation: Wfj. Verhaegh et al., IMPROVED FORCE-DIRECTED SCHEDULING IN HIGH-THROUGHPUT DIGITAL SIGNAL-PROCESSING, IEEE transactions on computer-aided design of integrated circuits and systems, 14(8), 1995, pp. 945-960
Citation: Mga. Verhoeven et al., A PARALLEL 2-OPT ALGORITHM FOR THE TRAVELING-SALESMAN PROBLEM, Future generations computer systems, 11(2), 1995, pp. 175-182
Citation: Pj. Zwietering et al., THE MINIMAL NUMBER OF LAYERS OF A PERCEPTRON THAT SORTS, Journal of parallel and distributed computing, 20(3), 1994, pp. 380-387