Tore Grünert

According to our database, Tore Grünert authored at least 10 papers between 1999 and 2006.

Collaborative distances:

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

2006

Sequential search and its application to vehicle-routing problems.

Stefan Irnich, Birger Funke, Tore Grünert

Comput. Oper. Res., 2006

2005

Local Search for Vehicle Routing and Scheduling Problems: Review and Conceptual Integration.

Birger Funke, Tore Grünert, Stefan Irnich

J. Heuristics, 2005

A Note on Single Alternating Cycle Neighborhoods for the TSP.

Birger Funke, Tore Grünert, Stefan Irnich

J. Heuristics, 2005

2002

Finding all <i>k</i>-cliques in <i>k</i>-partite graphs, an application in textile engineering.

Tore Grünert, Stefan Irnich, Hans-Jürgen Zimmermann, Markus Schneider, Burkhard Wulfhorst

Comput. Oper. Res., 2002

Minitrack Introduction.

Hans-Jürgen Sebastian, Tore Grünert, Mark E. Nissen

Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

Minitrack Introduction.

Hans-Jürgen Sebastian, Tore Grünert

Proceedings of the 35th Hawaii International Conference on System Sciences (HICSS-35 2002), 2002

2001

Intelligent Systems in Traffic and Transportation - Minitrack Introduction.

Hans-Jürgen Sebastian, Tore Grünert

Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001

2000

A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem.

Klaus Büdenbender, Tore Grünert, Hans-Jürgen Sebastian

Transp. Sci., 2000

Planning models for long-haul operations of postal and express shipment companies.

Tore Grünert, Hans-Jürgen Sebastian

Eur. J. Oper. Res., 2000

1999

The Design of a Letter-Mail Transportation Network by Intelligent Techniques.

Hans-Jürgen Sebastian, Tore Grünert, Michael Thärigen

Proceedings of the 32nd Annual Hawaii International Conference on System Sciences (HICSS-32), 1999