| 2009 |
|---|
| 16 | EE | Ulrich Derigs,
Stefan Friederichs:
Decision Support for Flow Management in a Recycling Network.
HICSS 2009: 1-9 |
| 2007 |
|---|
| 15 | | Sascha Dahl,
Ulrich Derigs:
Ein Decision Support System zur Kooperativen Tourenplanung in Verbünden Unabhängiger Transportdienstleister.
GI Jahrestagung (1) 2007: 57-61 |
| 14 | EE | Ulrich Derigs,
R. Kaiser:
Applying the attribute based hill climber heuristic to the vehicle routing problem.
European Journal of Operational Research 177(2): 719-732 (2007) |
| 2006 |
|---|
| 13 | EE | Felix Bomsdorf,
Ulrich Derigs,
Olaf Jenal:
Schedule This - A Decision Support System for Movie Shoot Scheduling.
OR 2006: 395-401 |
| 2005 |
|---|
| 12 | EE | Ulrich Derigs,
Thomas Döhmer:
Some Remarks on the GIST Approach for the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW).
OR 2005: 387-392 |
| 11 | EE | Paul Bartodziej,
Ulrich Derigs,
Boris Grein:
A Decision Support System for Strategic and Operational Planning of Road Feeder Services.
OR 2005: 43-48 |
| 10 | | Stefan Bell,
Ulrich Derigs,
Tobias Krautkremer:
Datenqualität bei Telematik-Anwendungen: Ein regelbasierter Data-Cleaner.
Datenbank-Spektrum 14: 29-33 (2005) |
| 2004 |
|---|
| 9 | EE | Ulrich Derigs,
Thomas Döhmer:
Router: A Fast and Flexible Local Search Algorithm for a Class of Rich Vehicle Routing Problems.
OR 2004: 144-149 |
| 8 | EE | Paul Bartodziej,
Ulrich Derigs:
On an Experimental Algorithm for Revenue Management for Cargo Airlines.
WEA 2004: 57-71 |
| 7 | EE | Ulrich Derigs,
Stefan Voß:
Preface.
Annals OR 131(1-4): 17-20 (2004) |
| 6 | EE | Ulrich Derigs,
Nils-H. Nickel:
On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management.
Annals OR 131(1-4): 45-77 (2004) |
| 1994 |
|---|
| 5 | EE | Jürgen Bendisch,
Ulrich Derigs,
Alfred Heske:
An Efficient Matching Algorithm Applied in Statistical Physics.
Discrete Applied Mathematics 52(2): 139-153 (1994) |
| 1991 |
|---|
| 4 | | Ulrich Derigs,
A. Metz:
Solving (large scale) matching problems combinatorially.
Math. Program. 50: 113-121 (1991) |
| 1985 |
|---|
| 3 | | Ulrich Derigs:
An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths.
Inf. Process. Lett. 21(5): 253-258 (1985) |
| 1980 |
|---|
| 2 | | Ulrich Derigs:
F-Factors, Perfect Matchings and Related Concepts.
WG 1980: 388-403 |
| 1 | | Ulrich Derigs,
Alfred Heske:
A Computational Study on Some Methods for Solving the Cardinality Matching Problem.
Angewandte Informatik 22(4): 149-154 (1980) |
