André Rohe - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 7 from 7

2003

Chained Lin-Kernighan for Large Traveling Salesman ProblemsDavid Applegate, William Cook, André Rohe. informs, 15(1):82-92, 2003. [doi]

An effective congestion-driven placement frameworkUlrich Brenner, André Rohe. tcad, 22(4):387-394, 2003. [doi]

Rectilinear group Steiner trees and applications in VLSI designMartin Zachariasen, André Rohe. mp, 94(2-3):407-433, 2003. [doi]

2002

Solution of a Min-Max Vehicle Routing ProblemDavid Applegate, William Cook, Sanjeeb Dash, André Rohe. informs, 14(2):132-143, 2002. [doi]

An effective congestion driven placement frameworkUlrich Brenner, André Rohe. ispd 2002: 6-11 [doi]

Solving a Hard Problem to Approximate an Easy One: Heuristics for Maximum Matchings and Maximum Traveling Salesman ProblemsSándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze. jea, 7:11, 2002. [doi]

2001

Solving a Hard Problem to Approximate an Easy One: Heuristics for Maximum Matchings and Maximum Traveling Salesman ProblemsSándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze. alenex 2001: 1-16 [doi]

Sign in or sign up to see more results.

runs on WebDSL