 | 2003 |
|---|
| 8 |       | Ulrich Brenner,
André Rohe:
An effective congestion-driven placement framework.
IEEE Trans. on CAD of Integrated Circuits and Systems 22(4): 387-394 (2003) |
| 7 | | David Applegate,
William Cook,
André Rohe:
Chained Lin-Kernighan for Large Traveling Salesman Problems.
INFORMS Journal on Computing 15(1): 82-92 (2003) |
| 2002 |
|---|
| 6 | | Ulrich Brenner,
André Rohe:
An effective congestion driven placement framework.
ISPD 2002: 6-11 |
| 5 | | Sándor P. Fekete,
Henk Meijer,
André Rohe,
Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.
ACM Journal of Experimental Algorithmics 7: 11 (2002) |
| 4 | | Sándor P. Fekete,
Henk Meijer,
André Rohe,
Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
CoRR cs.DS/0212044: (2002) |
| 3 | | David Applegate,
William Cook,
Sanjeeb Dash,
André Rohe:
Solution of a Min-Max Vehicle Routing Problem.
INFORMS Journal on Computing 14(2): 132-143 (2002) |
| 2001 |
|---|
| 2 | | Sándor P. Fekete,
Henk Meijer,
André Rohe,
Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.
ALENEX 2001: 1-16 |
| 1999 |
|---|
| 1 | | William Cook,
André Rohe:
Computing Minimum-Weight Perfect Matchings.
INFORMS Journal on Computing 11(2): 138-148 (1999) |
