Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Number of items: 17.

Article

Brueggemann, T. and Hurink, J.L. (2007) Two very large-scale neighborhoods for single machine scheduling. OR Spectrum, 29 (3). pp. 513-533. ISSN 0171-6468

Brueggemann, Tobias and Hurink, Johann and Vredeveld, Tjark and Woeginger, Gerhard J. (2011) Exponential size neighborhoods for makespan minimization scheduling. Naval Research Logistics, 58 (8). pp. 795-803. ISSN 0894-069X

Brueggemann, Tobias and Hurink, Johann L. (2011) Matching based very large-scale neighborhoods for parallel machine scheduling. Journal of Heuristics, 17 (6). pp. 637-658. ISSN 1381-1231

Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter (2006) Quality of Move-optimal Schedules for Minimizing Total Weigted Completion Time. Operations Research Letters, 34 (5). pp. 583-590. ISSN 0167-6377

Brueggemann, Tobias and Hurink, Johann L. and Kern, Walter (2006) Quality of move-optimal schedules for minimizing total weighted completion time. Operations Research Letters, 34 (5). pp. 583-590. ISSN 0167-6377

Brueggemann, Tobias and Kern, Walter (2004) An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science, 329 (1-3). pp. 303-313. ISSN 0304-3975

Brueggemann, Tobias and Vredeveld, Tjark and Woeginger, Gerhard J. (2006) Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines. Electronic Notes in Theoretical Computer Science, 25 (1). pp. 29-33. ISSN 1571-0661

Brüggemann, Tobias and Monnot, Jérôme and Woeginger, Gerhard J. (2003) Local search for the minimum label spanning tree problem with bounded color classes. Operations Research Letters (3). pp. 195-201. ISSN 0167-6377

Book Section

Brueggemann, Tobias and Kern, Walter (2004) An improved local search algorithm for 3-SAT. In: w. Electronic Notes in Discrete Mathematics, 17 . Elsevier, Workshop on Graphs and Combinatorial Optimization, pp. 69-73.

Conference or Workshop Item

Bonsma, Paul and Brueggemann, Tobias and Woeginger, Gerhard J. (2003) A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. In: 28th International Symposium on Mathematical Foundations of Computer Science, MFCS, August 25-29, 2003, Bratislava, Slovakia (pp. pp. 259-268).

Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2008) Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines. In: 5th International Workshop on Approximation and Online Algorithms, October 11-12, 2007, Eilat, Israel (pp. pp. 41-54).

Report

Brueggemann, T. and Hurink, J.L. (2005) Matching based exponential neighborhoods for parallel machine scheduling. [Report]

Brueggemann, T. and Hurink, J.L. (2005) Two exponential neighborhoods for single machine scheduling. [Report]

Brueggemann, T. and Hurink, J.L. (2006) Quality of Move-Optimal Schedules for Minimizing the Vector Norm of the Workloads. [Report]

Brueggemann, T. and Hurink, J.L. and Kern, W. (2005) Move-optimal schedules for parallel machines to minimize total weighted completion time. [Report]

Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2006) Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. [Report]

Brueggemann, T. and Kern, W. (2004) An improved local search algorithm for 3-SAT. [Report]

This list was generated on Fri Aug 29 05:32:44 2014 CEST.