Tobias Brueggemann

From MaRDI portal
(Redirected from Tobias Brueggemann)



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
Quality of move-optimal schedules for minimizing total weighted completion time
Operations Research Letters
2008-03-28Paper
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
Approximation and Online Algorithms
2008-02-20Paper
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science
2007-12-07Paper
Two very large-scale neighborhoods for single machine scheduling
OR Spectrum
2007-08-20Paper
An improved local search algorithm for 3-SAT
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
Electronic Notes in Discrete Mathematics
2007-05-29Paper
An improved deterministic local search algorithm for 3-SAT
Theoretical Computer Science
2005-02-09Paper
Local search for the minimum label spanning tree problem with bounded color classes.
Operations Research Letters
2003-06-17Paper


Research outcomes over time


This page was built for person: Tobias Brueggemann