Ulrich Derigs

Affiliations:
  • University of Cologne, Germany


According to our database1, Ulrich Derigs authored at least 68 papers between 1977 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
Solving multitrip vehicle routing under order incompatibilities: A VRP arising in supply chain management.
Networks, 2014

A note on extending the generic crew scheduling model of Beasley and Cao by deadheads and layovers.
J. Oper. Res. Soc., 2014

Experience with a framework for developing heuristics for solving rich vehicle routing problems.
J. Heuristics, 2014

2013
Air cargo scheduling: integrated models and solution procedures.
OR Spectr., 2013

Does EU ETS instigate Air Cargo network reconfiguration? A model-based analysis.
Eur. J. Oper. Res., 2013

A short note on applying a simple LS/LNS-based metaheuristic to the rollon-rolloff vehicle routing problem.
Comput. Oper. Res., 2013

Truck and trailer routing - Problems, heuristics and computational experience.
Comput. Oper. Res., 2013

Comparing Revenue Optimization Models for Low Cost Carriers Supporting Connecting Flights - A Case Study.
Proceedings of the Computational Logistics - 4th International Conference, 2013

2012
Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation.
Electron. Notes Discret. Math., 2012

2011
Vehicle routing with compartments: applications, modelling and heuristics.
OR Spectr., 2011

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., 2011

Cooperative planning in express carrier networks - An empirical study on the effectiveness of a real-time Decision Support System.
Decis. Support Syst., 2011

2010
Supporting strategic crew management at passenger railways - model, method and system.
Public Transp., 2010

Local search-based metaheuristics for the split delivery vehicle routing problem.
J. Oper. Res. Soc., 2010

On the Potentials of Parallelizing Large Neighbourhood Search for Rich Vehicle Routing Problems.
Proceedings of the Learning and Intelligent Optimization, 4th International Conference, 2010

2009
A New Approach for Air Cargo Network Planning.
Transp. Sci., 2009

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., 2009

A simple and efficient tabu search heuristic for solving the open vehicle routing problem.
J. Oper. Res. Soc., 2009

On the application of a transportation model for revenue optimization in waste management: a case study.
Central Eur. J. Oper. Res., 2009

Decision Support for Flow Management in a Recycling Network.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

2008
Indirect search for the vehicle routing problem with pickup and delivery and time windows.
OR Spectr., 2008

A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem.
OR Spectr., 2008

2007
O&D revenue management in cargo airlines - a mathematical programming approach.
OR Spectr., 2007

Applying the attribute based hill climber heuristic to the vehicle routing problem.
Eur. J. Oper. Res., 2007

Ein Decision Support System zur Kooperativen Tourenplanung in Verbünden Unabhängiger Transportdienstleister.
Proceedings of the 37. Jahrestagung der Gesellschaft für Informatik, 2007

2006
Schedule This - A Decision Support System for Movie Shoot Scheduling.
Proceedings of the Operations Research, 2006

2005
A GA-based decision support system for professional course scheduling at Ford Service Organisation.
OR Spectr., 2005

Datenqualität bei Telematik-Anwendungen: Ein regelbasierter Data-Cleaner.
Datenbank-Spektrum, 2005

Some Remarks on the GIST Approach for the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW).
Proceedings of the Operations Research Proceedings 2005, 2005

A Decision Support System for Strategic and Operational Planning of Road Feeder Services.
Proceedings of the Operations Research Proceedings 2005, 2005

2004
Preface.
Ann. Oper. Res., 2004

On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management.
Ann. Oper. Res., 2004

On an Experimental Algorithm for Revenue Management for Cargo Airlines.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Router: A Fast and Flexible Local Search Algorithm for a Class of Rich Vehicle Routing Problems.
Proceedings of the Operations Research, 2004

2003
Meta-heuristic based decision support for portfolio optimization with a case study on tracking error minimization in passive portfolio management.
OR Spectr., 2003

1998
SYNOPSE: a model-based decision support system for the evaluation of flight schedules for cargo airlines.
Decis. Support Syst., 1998

1994
An Efficient Matching Algorithm Applied in Statistical Physics.
Discret. Appl. Math., 1994

1992
Book review.
ZOR Methods Model. Oper. Res., 1992

Book Reviews.
ZOR Methods Model. Oper. Res., 1992

1991
Solving (large scale) matching problems combinatorially.
Math. Program., 1991

1990
Matching problems with generalized upper bound side constraints.
Networks, 1990

1989
Implementing Goldberg's max-flow-algorithm - A computational investigation.
ZOR Methods Model. Oper. Res., 1989

1986
Solving large-scale matching problems efficiently: A new primal matching approach.
Networks, 1986

An in-core/out-of-core method for solving large scale assignment problems.
Z. Oper. Research, 1986

Monge sequences and a simple assignment algorithm.
Discret. Appl. Math., 1986

An efficient labeling technique for solving sparse assignment problems.
Computing, 1986

On the use of optimal fractional matchings for solving the (integer) matching problem.
Computing, 1986

1985
An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths.
Inf. Process. Lett., 1985

Using Confidence Limits for the Global Optimum in Combinatorial Optimization.
Oper. Res., 1985

Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions.
Discret. Appl. Math., 1985

1984
Alternate strategies for solving bottleneck assignment problems - analysis and computational results.
Computing, 1984

1983
An analysis of alternative strategies for implementing matching algorithms.
Networks, 1983

Preface.
Networks, 1983

Buchbesprechungen.
Z. Oper. Research, 1983

Buchbesprechungen.
Z. Oper. Research, 1983

1982
Buchbesprechungen.
Z. Oper. Research, 1982

1981
A shortest augmenting path method for solving minimal perfect matching problems.
Networks, 1981

Buchbesprechungen.
Z. Oper. Research, 1981

1980
A Computational Study on Some Methods for Solving the Cardinality Matching Problem.
Angew. Inform., 1980

Book reviews.
Z. Oper. Research, 1980

F-Factors, Perfect Matchings and Related Concepts.
Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

1979
Buchbesprechungen.
Z. Oper. Research, 1979

Duality and admissible transformations in combinatorial optimization.
Z. Oper. Research, 1979

Buchbesprechungen.
Z. Oper. Research, 1979

A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective.
Discret. Appl. Math., 1979

An augmenting path method for solving Linear Bottleneck Transportation problems.
Computing, 1979

1978
An augmenting path method for solving Linear Bottleneck Assignment problems.
Computing, 1978

1977
Rangzuordnungsprobleme.
Math. Methods Oper. Res., 1977


  Loading...