Gerard A. P. Kindervater

According to our database, Gerard A. P. Kindervater authored at least 8 papers between 1986 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

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

1996

Towards an abstract parallel branch and bound machine.

Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens

Proceedings of the Solving Combinatorial Optimization Problems in Parallel, 1996

1995

Asynchronous Parallel Branch and Bound and Anomalies.

Arie de Bruin, Gerard A. P. Kindervater, Harry W. J. M. Trienekens

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1993

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

1991

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

1989

The Parallel Complexity of TSP Heuristics.

Gerard A. P. Kindervater, Jan Karel Lenstra, David B. Shmoys

J. Algorithms, 1989

OR Forum - Perspectives on Parallel Computing.

Gerard A. P. Kindervater, Jan Karel Lenstra, A. H. G. Rinnooy Kan

Oper. Res., 1989

1986

An introduction to parallelism in combinatorial optimization.

Gerard A. P. Kindervater, Jan Karel Lenstra

Discret. Appl. Math., 1986