Ulrich Derigs

From MaRDI portal
Person:340252

Available identifiers

zbMath Open derigs.ulrichMaRDI QIDQ340252

List of research outcomes





PublicationDate of PublicationType
A computational study comparing different multiple neighbourhood strategies for solving rich vehicle routing problems2019-06-18Paper
Truck and trailer routing -- problems, heuristics and computational experience2016-11-14Paper
Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation2013-07-23Paper
Air cargo scheduling: integrated models and solution procedures2013-03-28Paper
Vehicle routing with compartments: applications, modelling and heuristics2012-01-13Paper
AgileGIST - a Framework for Iterative Development and Rapid Prototyping of DSS for Combinatorial Problems2011-04-07Paper
Schedule This - A Decision Support System for Movie Shoot Scheduling2011-04-07Paper
Planning in Express Carrier Networks: A Simulation Study2011-04-07Paper
A GA Based Approach for Solving Multi Criteria Project Scheduling Problems2011-04-07Paper
A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem2010-09-08Paper
On the application of a transportation model for revenue optimization in waste management: a case study2009-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 transportation2009-05-13Paper
Indirect search for the vehicle routing problem with pickup and delivery and time windows2008-04-03Paper
O\&D revenue management in cargo airlines-a mathematical programming approach2007-01-11Paper
A gA-based decision support system for professional course scheduling at ford service organisation2005-02-24Paper
On a local-search heuristic for a class of tracking error minimization problems in portfolio management2005-01-17Paper
Meta-heuristic based decision support for portfolio optimization with a case study on tracking error minimization in passive portfolio management2003-08-27Paper
https://portal.mardi4nfdi.de/entity/Q44951872001-11-21Paper
https://portal.mardi4nfdi.de/entity/Q47624642001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q42333991999-11-10Paper
Genetic modeling of artificial neural nets. An application to credit evaluation1997-12-11Paper
An efficient matching algorithm applied in statistical physics1995-03-01Paper
Intime - A New Heuristic Approach to the Vehicle Routing Problem with Time Windows, with a Bakery Fleet Case1994-09-13Paper
Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms1993-06-05Paper
https://portal.mardi4nfdi.de/entity/Q40356391993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40269881993-02-21Paper
A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints1993-01-16Paper
Solving (large scale) matching problems combinatorially1991-01-01Paper
Matching problems with generalized upper bound side constraints1990-01-01Paper
Monge sequences and a simple assignment algorithm1986-01-01Paper
On the use of optimal fractional matchings for solving the (integer) matching problem1986-01-01Paper
An in-core/out-of-core method for solving large scale assignment problems1986-01-01Paper
Solving large-scale matching problems efficiently: A new primal matching approach1986-01-01Paper
An efficient labeling technique for solving sparse assignment problems1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37505181986-01-01Paper
A short note on matching algorithms1986-01-01Paper
Using Confidence Limits for the Global Optimum in Combinatorial Optimization1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36789671985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36881031985-01-01Paper
Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions1985-01-01Paper
An efficient Dijkstra-like labeling method for computing shortest odd/even paths1985-01-01Paper
Alternate strategies for solving bottleneck assignment problems - analysis and computational results1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33094511984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33201261984-01-01Paper
An analysis of alternative strategies for implementing matching algorithms1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36613161983-01-01Paper
On three basic methods for solving bottleneck transportation problems1982-01-01Paper
Efficiency and time-cost-tradeoffs in transportation problems1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39582911982-01-01Paper
A shortest augmenting path method for solving minimal perfect matching problems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39116871981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39210151981-01-01Paper
Admissible Transformations and their Application to Matching Problems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314411981-01-01Paper
Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39551551980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38756971980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38888761980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39210161980-01-01Paper
Duality and admissible transformations in combinatorial optimization1979-01-01Paper
An augmenting path method for solving linear bottleneck transportation problems1979-01-01Paper
A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective1979-01-01Paper
An augmenting path method for solving linear bottleneck assignment problems1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41732251978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41816331978-01-01Paper
Rangzuordnungsprobleme1977-01-01Paper

Research outcomes over time

This page was built for person: Ulrich Derigs