Dino Ahr

According to our database, Dino Ahr authored at least 6 papers between 1997 and 2006.

Collaborative distances:

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

2006

A tabu search algorithm for the min-max <i>k</i>-Chinese postman problem.

Dino Ahr, Gerhard Reinelt

Comput. Oper. Res., 2006

2004

Contributions to Multiple Postmen Problems

Dino Ahr

PhD thesis, 2004

An exact algorithm for scheduling identical coupled tasks.

Dino Ahr, József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt

Math. Methods Oper. Res., 2004

2002

New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.

Dino Ahr, Gerhard Reinelt

Proceedings of the Algorithms, 2002

1999

Project Workspaces for Parallel Computing - The TRAPPER Approach.

Dino Ahr, Andreas Bäcker

Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

1997

WINPAR - Windows-based Parallel Computing.

Andreas Bäcker, Dino Ahr, Ottmar Krämer-Fuhrmann, Róbert Lovas, Hermann Mierendorff, Helmut Schwamborn, João Gabriel Silva, Klaus Wolf

Proceedings of the Parallel Computing: Fundamentals, 1997