Gerald Paul

According to our database, Gerald Paul authored at least 9 papers between 2007 and 2017.

Collaborative distances:

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

2017

Optimal Solutions to Large Logistics Planning Domain Problems.

Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

2016

Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis.

Gerald Paul, Malte Helmert

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

2012

A GPU implementation of the Simulated Annealing Heuristic for the Quadratic Assignment Problem

Gerald Paul

CoRR, 2012

2011

An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems.

Gerald Paul

Eur. J. Oper. Res., 2011

An efficient implementation of the simulated annealing heuristic for the quadratic assignment problem

Gerald Paul

CoRR, 2011

2010

Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem.

Gerald Paul

Oper. Res. Lett., 2010

Catastrophic Cascade of Failures in Interdependent Networks

Shlomo Havlin, N. A. M. Araujo, Sergey V. Buldyrev, C. S. Dias, Roni Parshani, Gerald Paul, Harry Eugene Stanley

CoRR, 2010

2009

A Variable Depth Sequential Search Heuristic for the Quadratic Assignment Problem

Gerald Paul

CoRR, 2009

2007

A Complexity O(1) priority queue for event driven molecular dynamics simulations.

Gerald Paul

J. Comput. Phys., 2007