Publicaties




S. O. Krumke, W. E. de Paepe, D. Poensgen, L. Stougie, Erratum to News from the online traveling repairman, Theoretical Computer Science, 352:1-3 (2006) 347-348

W.E. de Paepe, J.K. Lenstra, J. Sgall, R.A. Sitters, L. Stougie, Computer-Aided Complexity Classification of Dial-a-Ride Problems, INFORMS, Journal On Computing, Vol. 16, No. 2, Spring 2004, pp. 120-132

M. Lipmann, X. Lu, W.E. de Paepe, R.A. Sitters, L. Stougie, On-line dial-a-ride problems under a restricted information model, Algorithmica, Vol. 40, No. 4, 2004,  p.319-329

S.O. Krumke, W.E. de Paepe, D. Poensgen, and L. Stougie, News from the online traveling repairman
Theoretical Computer Science, 295:1-3 (2003) 279-294


M. Blom, S.O. Krumke, W.E. de Paepe, and L. Stougie, The online-TSP against fair adversariesInforms Journal on Computing, 13:2 (2001) 138-148

Refereed Conference Proceedings
S. O. Krumke, W. E. de Paepe, D. Poensgen, M. Lipmann, A. Marchetti-Spaccamela, L. Stougie, On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem, Proceedings of the 3rd Workshop on on Approximation and Online Algorithms, Lecture Notes in Computer Science 3879, Springer, 2006, 258-269


M. Lipmann, S.O. Krumke, L. Laura, A. Marcetti-Spaccamela, W.E. de Paepe, D. Poensgen, L. Stougie, Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problemProceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, Lecture Notes in Computer Science 2462, Springer, 2002, 200-214

M. Lipmann, X. Lu, W.E. de Paepe, R.A. Sitters, L. Stougie, On-line dial-a-ride problems under a restricted information model,
Proceedings of the 10th Annual European Symposium on Algorithms, 2002,  109-118

S.O. Krumke, M. Lipmann, W.E. de Paepe, D. Poensgen, J. Rambau, L. Stougie, and G.J. Woeginger, How to cut a cake almost fairly
Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, 263-264

S. O. Krumke, W. E. de Paepe, D. Poensgen, L. Stougie, News from the Online Traveling Repairman, Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 2136, 2001, 487-499

S.O. Krumke, W.E. de Paepe, L. Stougie, and J. Rambau, Online bincoloring
Proceedings of the 9th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 2161, 2001, 74-84

M. Blom, S.O. Krumke, W.E. de Paepe, and L. Stougie, The online-TSP against fair adversaries
Proceedings of the 4th Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science 1767, Springer, 2000, 137-149

Thesises
W.E. de Paepe, Complexity Results and Competitive Analysis for Vehicle Routing Problems, proefschrift, Technische Universiteit Eindhoven, 2002

W.E. de Paepe, Computer-Aided Complexity Classification of Dial-a-Ride Problems, scriptie, Universiteit van Amsterdam, 1998


Supervised master thesises
Matthijs Kooij,  Advanced Planning en Scheduling binnen de revalidatiezorg, scriptie, Vrije Universiteit van Amsterdam, 2008

Bilal Singer, Optimaliseren in de openbaar vervoer sector, scriptie, Vrije Universiteit van Amsterdam, 2008

Paul Janssen, Onderzoek naar de klantwachttijd in relatie met de personeelsinzet bij de ANWB-wegenwacht district Zuid, scriptie, Technische Universiteit Eindhoven, 2002



Geen opmerkingen:

Een reactie posten