The following pages link to Tobias Brueggemann (Q415565):
Displaying 11 items.
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- An improved deterministic local search algorithm for 3-SAT (Q706635) (← links)
- (Q1811626) (redirect page) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
- Two very large-scale neighborhoods for single machine scheduling (Q2642308) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- An improved local search algorithm for 3-SAT (Q3439130) (← links)
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (Q3439462) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431312) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
