Tobias Brüggemann

According to our database, Tobias Brüggemann authored at least 12 papers between 2003 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

Matching based very large-scale neighborhoods for parallel machine scheduling.

Tobias Brüggemann, Johann L. Hurink

J. Heuristics, 2011

2007

Two very large-scale neighborhoods for single machine scheduling.

Tobias Brüggemann, Johann L. Hurink

OR Spectr., 2007

Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.

Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006

Efficiency of Local Search.

Tobias Brüggemann

PhD thesis, 2006

Mobile Preisvergleichsdienste am Scheideweg.

Tobias Brüggemann, Michael H. Breitner

Wirtschaftsinf., 2006

Quality of move-optimal schedules for minimizing total weighted completion time.

Tobias Brüggemann, Johann L. Hurink, Walter Kern

Oper. Res. Lett., 2006

Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines.

Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger

Electron. Notes Discret. Math., 2006

2004

An improved deterministic local search algorithm for 3-SAT.

Tobias Brüggemann, Walter Kern

Theor. Comput. Sci., 2004

An improved local search algorithm for 3-SAT.

Tobias Brüggemann, Walter Kern

Electron. Notes Discret. Math., 2004

Mobile Preisvergleichsdienste.

Tobias Brüggemann, Michael H. Breitner

Proceedings of the Mobile Economy, 2004

2003

Local search for the minimum label spanning tree problem with bounded color classes.

Tobias Brüggemann, Jérôme Monnot, Gerhard J. Woeginger

Oper. Res. Lett., 2003

A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves.

Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003