M. G. A. Verhoeven

According to our database, M. G. A. Verhoeven authored at least 6 papers between 1992 and 1999.

Collaborative distances:

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

1999

Parallel local search for Steiner trees in graphs.

M. G. A. Verhoeven, M. E. M. Severens

Ann. Oper. Res., 1999

1998

Tabu search for resource-constrained scheduling.

M. G. A. Verhoeven

Eur. J. Oper. Res., 1998

1995

Parallel local search.

M. G. A. Verhoeven, Emile H. L. Aarts

J. Heuristics, 1995

A parallel 2-opt algorithm for the Traveling Salesman Problem.

M. G. A. Verhoeven, Emile H. L. Aarts, P. C. J. Swinkels

Future Gener. Comput. Syst., 1995

1993

A Parallel Lin-Kernighan Algorithm for the Travelling Salesman Problem.

M. G. A. Verhoeven, Emile H. L. Aarts

Proceedings of the Parallel Computing: Trends and Applications, 1993

1992

Parallel Local Search and the Travelling Salesman Problem.

M. G. A. Verhoeven, Emile H. L. Aarts, E. van Sluis, Rob J. M. Vaessens

Proceedings of the Parallel Problem Solving from Nature 2, 1992