default search action
Ulrich Derigs
Person information
- affiliation: University of Cologne, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j59]Ulrich Derigs, Ulrich Vogel:
Experience with a framework for developing heuristics for solving rich vehicle routing problems. J. Heuristics 20(1): 75-106 (2014) - [j58]Ulrich Derigs, Simon Schäfer:
A note on extending the generic crew scheduling model of Beasley and Cao by deadheads and layovers. J. Oper. Res. Soc. 65(5): 633-644 (2014) - [j57]Ulrich Derigs, Markus Pullmann:
Solving multitrip vehicle routing under order incompatibilities: A VRP arising in supply chain management. Networks 64(1): 29-39 (2014) - 2013
- [j56]Ulrich Derigs, Markus Pullmann, Ulrich Vogel:
Truck and trailer routing - Problems, heuristics and computational experience. Comput. Oper. Res. 40(2): 536-546 (2013) - [j55]Ulrich Derigs, Markus Pullmann, Ulrich Vogel:
A short note on applying a simple LS/LNS-based metaheuristic to the rollon-rolloff vehicle routing problem. Comput. Oper. Res. 40(3): 867-872 (2013) - [j54]Ulrich Derigs, Stefan Illing:
Does EU ETS instigate Air Cargo network reconfiguration? A model-based analysis. Eur. J. Oper. Res. 225(3): 518-527 (2013) - [j53]Ulrich Derigs, Stefan Friederichs:
Air cargo scheduling: integrated models and solution procedures. OR Spectr. 35(2): 325-362 (2013) - [c11]Ulrich Derigs, Benjamin Juds, Andreas Palm:
Comparing Revenue Optimization Models for Low Cost Carriers Supporting Connecting Flights - A Case Study. ICCL 2013: 199-212 - 2012
- [j52]Ulrich Derigs, Markus Pullmann, Ulrich Vogel, Marco Oberscheider, Manfred Gronalt, Patrick Hirsch
:
Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation. Electron. Notes Discret. Math. 39: 281-288 (2012) - 2011
- [j51]Sascha Dahl, Ulrich Derigs:
Cooperative planning in express carrier networks - An empirical study on the effectiveness of a real-time Decision Support System. Decis. Support Syst. 51(3): 620-626 (2011) - [j50]Ulrich Derigs, René Kurowsky, Ulrich Vogel:
Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services. Eur. J. Oper. Res. 213(1): 309-319 (2011) - [j49]Ulrich Derigs, Jens Gottlieb
Vehicle routing with compartments: applications, modelling and heuristics. OR Spectr. 33(4): 885-914 (2011) - 2010
- [j48]Ulrich Derigs, B. Li, Ulrich Vogel:
Local search-based metaheuristics for the split delivery vehicle routing problem. J. Oper. Res. Soc. 61(9): 1356-1364 (2010) - [j47]Ulrich Derigs, Dominik Malcherek, Simon Schäfer:
Supporting strategic crew management at passenger railways - model, method and system. Public Transp. 2(4): 307-334 (2010) - [c10]Paul Bartodziej, Ulrich Derigs, Ulrich Vogel:
On the Potentials of Parallelizing Large Neighbourhood Search for Rich Vehicle Routing Problems. LION 2010: 216-219
2000 – 2009
- 2009
- [j46]Ulrich Derigs, Stefan Friederichs:
On the application of a transportation model for revenue optimization in waste management: a case study. Central Eur. J. Oper. Res. 17(1): 81-93 (2009) - [j45]Ulrich Derigs, K. Reuter:
A simple and efficient tabu search heuristic for solving the open vehicle routing problem. J. Oper. Res. Soc. 60(12): 1658-1669 (2009) - [j44]Paul Bartodziej, Ulrich Derigs, Dominik Malcherek, Ulrich Vogel:
Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints : an application to road feeder service planning in air cargo transportation. OR Spectr. 31(2): 405-429 (2009) - [j43]Ulrich Derigs, Stefan Friederichs, Simon Schäfer:
A New Approach for Air Cargo Network Planning. Transp. Sci. 43(3): 370-380 (2009) - [c9]Ulrich Derigs, Stefan Friederichs:
Decision Support for Flow Management in a Recycling Network. HICSS 2009: 1-9 - 2008
- [j42]Ulrich Derigs, Thomas Döhmer:
Indirect search for the vehicle routing problem with pickup and delivery and time windows. OR Spectr. 30(1): 149-165 (2008) - [j41]Felix Bomsdorf, Ulrich Derigs:
A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem. OR Spectr. 30(4): 751-772 (2008) - 2007
- [j40]Ulrich Derigs, R. Kaiser:
Applying the attribute based hill climber heuristic to the vehicle routing problem. Eur. J. Oper. Res. 177(2): 719-732 (2007) - [j39]Paul Bartodziej, Ulrich Derigs, Markus Zils:
O&D revenue management in cargo airlines - a mathematical programming approach. OR Spectr. 29(1): 105-121 (2007) - [c8]Sascha Dahl, Ulrich Derigs:
Ein Decision Support System zur Kooperativen Tourenplanung in Verbünden Unabhängiger Transportdienstleister. GI Jahrestagung (1) 2007: 57-61 - 2006
- [c7]Felix Bomsdorf, Ulrich Derigs, Olaf Jenal:
Schedule This - A Decision Support System for Movie Shoot Scheduling. OR 2006: 395-401 - 2005
- [j38]Stefan Bell, Ulrich Derigs, Tobias Krautkremer:
Datenqualität bei Telematik-Anwendungen: Ein regelbasierter Data-Cleaner. Datenbank-Spektrum 14: 29-33 (2005) - [j37]Ulrich Derigs, Olaf Jenal:
A GA-based decision support system for professional course scheduling at Ford Service Organisation. OR Spectr. 27(1): 147-162 (2005) - [c6]Paul Bartodziej, Ulrich Derigs, Boris Grein:
A Decision Support System for Strategic and Operational Planning of Road Feeder Services. OR 2005: 43-48 - [c5]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 - 2004
- [j36]Ulrich Derigs, Stefan Voß
Preface. Ann. Oper. Res. 131(1-4): 17-20 (2004) - [j35]Ulrich Derigs, Nils-H. Nickel:
On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management. Ann. Oper. Res. 131(1-4): 45-77 (2004) - [c4]Ulrich Derigs, Nils-H. Nickel:
Ein neuer Ansatz zur modellbasierten Portfolio-optimierung in Kapitalanlagegesellschaften. Liechtensteinisches Wirtschaftsinformatik-Symposium 2004: 35-49 - [c3]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 - [c2]Paul Bartodziej, Ulrich Derigs:
On an Experimental Algorithm for Revenue Management for Cargo Airlines. WEA 2004: 57-71 - 2003
- [j34]Ulrich Derigs, Nils-H. Nickel:
Meta-heuristic based decision support for portfolio optimization with a case study on tracking error minimization in passive portfolio management. OR Spectr. 25(3): 345-378 (2003)
1990 – 1999
- 1998
- [j33]Jürgen Antes, Campen Campen, Ulrich Derigs, C. Titze, G.-D. Wolle:
SYNOPSE: a model-based decision support system for the evaluation of flight schedules for cargo airlines. Decis. Support Syst. 22(4): 307-323 (1998) - 1994
- [j32]Jürgen Bendisch, Ulrich Derigs, Alfred Heske:
An Efficient Matching Algorithm Applied in Statistical Physics. Discret. Appl. Math. 52(2): 139-153 (1994) - 1992
- [j31]Ulrich Derigs:
Book Reviews. ZOR Methods Model. Oper. Res. 36(5): 474-475 (1992) - [j30]Ulrich Derigs:
Book review. ZOR Methods Model. Oper. Res. 36(6): 546 (1992) - 1991
- [j29]Ulrich Derigs, Achim Metz:
Solving (large scale) matching problems combinatorially. Math. Program. 50: 113-121 (1991) - 1990
- [j28]Michael O. Ball, Ulrich Derigs, C. Hilbrand, Achim Metz:
Matching problems with generalized upper bound side constraints. Networks 20(6): 703-721 (1990)
1980 – 1989
- 1989
- [j27]Ulrich Derigs, W. Meier:
Implementing Goldberg's max-flow-algorithm - A computational investigation. ZOR Methods Model. Oper. Res. 33(6): 383-403 (1989) - 1988
- [j26]Ulrich Derigs:
Book review. ZOR Methods Model. Oper. Res. 32(5): 298 (1988) - 1986
- [j25]Ulrich Derigs, Achim Metz:
On the use of optimal fractional matchings for solving the (integer) matching problem. Computing 36(3): 263-270 (1986) - [j24]Ulrich Derigs, Achim Metz:
An efficient labeling technique for solving sparse assignment problems. Computing 36(4): 301-311 (1986) - [j23]Ulrich Derigs, Oskar Goecke, Rainer Schrader:
Monge sequences and a simple assignment algorithm. Discret. Appl. Math. 15(2-3): 241-248 (1986) - [j22]Ulrich Derigs, Achim Metz:
An in-core/out-of-core method for solving large scale assignment problems. Z. Oper. Research 30(5) (1986) - [j21]Ulrich Derigs:
Solving large-scale matching problems efficiently: A new primal matching approach. Networks 16(1): 1-16 (1986) - 1985
- [j20]Ulrich Derigs:
Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions. Discret. Appl. Math. 11(2): 129-141 (1985) - [j19]Ulrich Derigs:
Using Confidence Limits for the Global Optimum in Combinatorial Optimization. Oper. Res. 33(5): 1024-1049 (1985) - [j18]Ulrich Derigs:
An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths. Inf. Process. Lett. 21(5): 253-258 (1985) - 1984
- [j17]Ulrich Derigs:
Alternate strategies for solving bottleneck assignment problems - analysis and computational results. Computing 33(2): 95-106 (1984) - 1983
- [j16]Ulrich Derigs:
Buchbesprechungen. Z. Oper. Research 27(1) (1983) - [j15]Ulrich Derigs, K. Flemming:
Buchbesprechungen. Z. Oper. Research 27(1) (1983) - [j14]Michael O. Ball, Ulrich Derigs:
Preface. Networks 13(4): 453-454 (1983) - [j13]Michael O. Ball, Ulrich Derigs:
An analysis of alternative strategies for implementing matching algorithms. Networks 13(4): 517-549 (1983) - 1982
- [j12]A. Ruff, Ulrich Derigs:
Buchbesprechungen. Z. Oper. Research 26(1) (1982) - 1981
- [j11]A. Jaeger, R. K. Huber, Bernd Schiemenz, Götz Uebe, Ulrich Derigs, Peter Brucker, Johannes Jahn:
Buchbesprechungen. Z. Oper. Research 25(2) (1981) - [j10]Ulrich Derigs:
A shortest augmenting path method for solving minimal perfect matching problems. Networks 11(4): 379-390 (1981) - 1980
- [j9]B. Kulla, Ulrich Derigs:
Book reviews. Z. Oper. Research 24(1): 71-72 (1980) - [j8]Ulrich Derigs, Alfred Heske:
A Computational Study on Some Methods for Solving the Cardinality Matching Problem. Angew. Inform. 22(4): 149-154 (1980) - [c1]Ulrich Derigs:
F-Factors, Perfect Matchings and Related Concepts. WG 1980: 388-403
1970 – 1979
- 1979
- [j7]Ulrich Derigs, Uwe Zimmermann:
An augmenting path method for solving Linear Bottleneck Transportation problems. Computing 22(1): 1-15 (1979) - [j6]Ulrich Derigs:
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective. Discret. Appl. Math. 1(3): 167-180 (1979) - [j5]H. Bothe, Ulrich Derigs, Klaus-Peter Kistner, Jochen Schwarze, Hartmut Noltemeier, A. Jaeger, R. Weber, S. Albers, V. Steinecke, W. P. Schmidt:
Buchbesprechungen. Z. Oper. Research 23(6): B183-B190 (1979) - [j4]Ulrich Derigs:
Duality and admissible transformations in combinatorial optimization. Z. Oper. Research 23(7): 251-267 (1979) - [j3]E. Zahn, Norbert Wittemann, M. Schader, Ulrich Derigs, H. Knepel, H. J. Skala:
Buchbesprechungen. Z. Oper. Research 23(8): B261-B266 (1979) - 1978
- [j2]Ulrich Derigs, Uwe Zimmermann:
An augmenting path method for solving Linear Bottleneck Assignment problems. Computing 19(4): 285-295 (1978) - 1977
- [j1]Ulrich Derigs:
Rangzuordnungsprobleme. Math. Methods Oper. Res. 21(1): 75-83 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-26 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: