Florian Diedrich - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2015

Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time WindowsNiklas Paulsen, Florian Diedrich, Klaus Jansen. atmos 2015: 42-55 [doi]

2012

Tight approximation algorithms for scheduling with fixed jobs and nonavailabilityFlorian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson. TALG, 8(3):27, 2012. [doi]

2010

Approximation Algorithms for Scheduling with ReservationsFlorian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram. algorithmica, 58(2):391-404, 2010. [doi]

2009

Approximation algorithms for linear programs and geometrically constrained packing roblems (Algorithmes d'approximation pour des programmes linéaires et les problèmes de Packing avec des contraintes géometriques)Florian Diedrich. PhD thesis, Kiel University, Germany, 2009. [doi]

Improved approximation algorithms for scheduling with fixed jobsFlorian Diedrich, Klaus Jansen. soda 2009: 675-684 [doi]

A Survey on Approximation Algorithms for Scheduling with Machine UnavailabilityFlorian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram. dfg 2009: 50-64 [doi]

2008

Using fast matrix multiplication in bio-inspired computation for complex optimization problemsFlorian Diedrich, Frank Neumann. cec 2008: 3827-3832 [doi]

Multi-objective Problems in Terms of Relational AlgebraFlorian Diedrich, Britta Kehden, Frank Neumann. RelMiCS 2008: 84-98 [doi]

Approximation Algorithms for 3D Orthogonal KnapsackFlorian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas. jcst, 23(5):749-762, 2008. [doi]

2007

2006

Implementation of Approximation Algorithms for the Max-Min Resource Sharing ProblemMihhail Aizatulin, Florian Diedrich, Klaus Jansen. wea 2006: 207-218 [doi]

Sign in or sign up to see more results.

runs on WebDSL