Ulrich Derigs

From MaRDI portal
(Redirected from Person:340252)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems
IMA Journal of Management Mathematics
2019-06-18Paper
Truck and trailer routing -- problems, heuristics and computational experience
Computers & Operations Research
2016-11-14Paper
Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation
Electronic Notes in Discrete Mathematics
2013-07-23Paper
Air cargo scheduling: integrated models and solution procedures
OR Spectrum
2013-03-28Paper
Vehicle routing with compartments: applications, modelling and heuristics
OR Spectrum
2012-01-13Paper
AgileGIST - a Framework for Iterative Development and Rapid Prototyping of DSS for Combinatorial Problems
Operations Research Proceedings 2008
2011-04-07Paper
Schedule this -- a decision support system for movie shoot scheduling
Operations Research Proceedings
2011-04-07Paper
Planning in express carrier networks: a simulation study
Operations Research Proceedings 2008
2011-04-07Paper
A GA based approach for solving multi criteria project scheduling problems
Operations Research Proceedings 2008
2011-04-07Paper
A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem
OR Spectrum
2010-09-08Paper
On the application of a transportation model for revenue optimization in waste management: a case study
CEJOR. Central European Journal of Operations Research
2009-06-22Paper
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 Spectrum
2009-05-13Paper
Indirect search for the vehicle routing problem with pickup and delivery and time windows
OR Spectrum
2008-04-03Paper
O\&D revenue management in cargo airlines-a mathematical programming approach
OR Spectrum
2007-01-11Paper
A gA-based decision support system for professional course scheduling at ford service organisation
OR Spectrum
2005-02-24Paper
On a local-search heuristic for a class of tracking error minimization problems in portfolio management
Annals of Operations Research
2005-01-17Paper
Meta-heuristic based decision support for portfolio optimization with a case study on tracking error minimization in passive portfolio management
OR Spectrum
2003-08-27Paper
scientific article; zbMATH DE number 1488083 (Why is no real title available?)2001-11-21Paper
scientific article; zbMATH DE number 1568937 (Why is no real title available?)2001-10-14Paper
scientific article; zbMATH DE number 1264454 (Why is no real title available?)1999-11-10Paper
Genetic modeling of artificial neural nets. An application to credit evaluation
OR Spektrum
1997-12-11Paper
An efficient matching algorithm applied in statistical physics
Discrete Applied Mathematics
1995-03-01Paper
Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case
American Journal of Mathematical and Management Sciences
1994-09-13Paper
Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
Lecture Notes in Economics and Mathematical Systems
1993-06-05Paper
scientific article; zbMATH DE number 176477 (Why is no real title available?)1993-05-18Paper
scientific article; zbMATH DE number 125292 (Why is no real title available?)1993-02-21Paper
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
OR Spektrum
1993-01-16Paper
Solving (large scale) matching problems combinatorially
Mathematical Programming. Series A. Series B
1991-01-01Paper
Matching problems with generalized upper bound side constraints
Networks
1990-01-01Paper
Monge sequences and a simple assignment algorithm
Discrete Applied Mathematics
1986-01-01Paper
On the use of optimal fractional matchings for solving the (integer) matching problem
Computing
1986-01-01Paper
An in-core/out-of-core method for solving large scale assignment problems
Zeitschrift für Operations Research
1986-01-01Paper
Solving large-scale matching problems efficiently: A new primal matching approach
Networks
1986-01-01Paper
An efficient labeling technique for solving sparse assignment problems
Computing
1986-01-01Paper
scientific article; zbMATH DE number 3987052 (Why is no real title available?)1986-01-01Paper
A short note on matching algorithms
Mathematical Programming Studies
1986-01-01Paper
Using Confidence Limits for the Global Optimum in Combinatorial Optimization
Operations Research
1985-01-01Paper
scientific article; zbMATH DE number 3900499 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3912108 (Why is no real title available?)1985-01-01Paper
Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
Discrete Applied Mathematics
1985-01-01Paper
An efficient Dijkstra-like labeling method for computing shortest odd/even paths
Information Processing Letters
1985-01-01Paper
Alternate strategies for solving bottleneck assignment problems - analysis and computational results
Computing
1984-01-01Paper
scientific article; zbMATH DE number 3839683 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3850824 (Why is no real title available?)1984-01-01Paper
An analysis of alternative strategies for implementing matching algorithms
Networks
1983-01-01Paper
scientific article; zbMATH DE number 3813351 (Why is no real title available?)1983-01-01Paper
On three basic methods for solving bottleneck transportation problems
Naval Research Logistics Quarterly
1982-01-01Paper
Efficiency and time-cost-tradeoffs in transportation problems
OR Spektrum
1982-01-01Paper
scientific article; zbMATH DE number 3779125 (Why is no real title available?)1982-01-01Paper
A shortest augmenting path method for solving minimal perfect matching problems
Networks
1981-01-01Paper
scientific article; zbMATH DE number 3722441 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3733677 (Why is no real title available?)1981-01-01Paper
Admissible Transformations and their Application to Matching Problems
North-Holland Mathematics Studies
1981-01-01Paper
scientific article; zbMATH DE number 3745237 (Why is no real title available?)1981-01-01Paper
Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
Lecture Notes in Economics and Mathematical Systems
1980-01-01Paper
scientific article; zbMATH DE number 3775260 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3679543 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3694970 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3733678 (Why is no real title available?)1980-01-01Paper
Duality and admissible transformations in combinatorial optimization
Zeitschrift für Operations Research
1979-01-01Paper
An augmenting path method for solving linear bottleneck transportation problems
Computing
1979-01-01Paper
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
Discrete Applied Mathematics
1979-01-01Paper
An augmenting path method for solving linear bottleneck assignment problems
Computing
1978-01-01Paper
scientific article; zbMATH DE number 3607842 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3617926 (Why is no real title available?)1978-01-01Paper
Rangzuordnungsprobleme
Zeitschrift für Operations Research
1977-01-01Paper


Research outcomes over time


This page was built for person: Ulrich Derigs