An introduction to parallelism in combinatorial optimization. - Gerard A. P. Kindervater; Jan Karel Lenstra (Discret. Appl. Math., 1986)

OR Forum - Perspectives on Parallel Computing. - Gerard A. P. Kindervater; Jan Karel Lenstra; A. H. G. Rinnooy Kan (Oper. Res., 1989)

The Parallel Complexity of TSP Heuristics. - Gerard A. P. Kindervater; Jan Karel Lenstra; David B. Shmoys (J. Algorithms, 1989)

A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master-Slave Architecture. - Onno J. Boxma; Gerard A. P. Kindervater (Oper. Res., 1991)

Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. - Gerard A. P. Kindervater; Jan Karel Lenstra; Martin W. P. Savelsbergh (Discret. Appl. Math., 1993)

Asynchronous Parallel Branch and Bound and Anomalies. - Arie de Bruin; Gerard A. P. Kindervater; Harry W. J. M. Trienekens (IRREGULAR, 1995)

Towards an abstract parallel branch and bound machine. - Arie de Bruin; Gerard A. P. Kindervater; Harry W. J. M. Trienekens (Solving Combinatorial Optimization Problems in Parallel, 1996)

Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents. - Arie de Bruin; Gerard A. P. Kindervater; Tjark Vredeveld; Albert P. M. Wagelmans (Constraints An Int. J., 2003)