Single-track train timetabling with guaranteed optimality: Branch-and-bound algorithms with enhanced lower bounds

Business & Economics

• Timetabling 100%
• Branch and Bound Algorithm 89%
• Optimality 86%
• Lower Bounds 68%
• Train 65%
• Upper Bound 27%
• Beam Search 22%
• Schedule 21%
• Timetabling Problem 20%
• Lagrangian Relaxation 18%
• Resource-constrained Project Scheduling 17%
• Branch-and-bound 17%
• Heuristic Method 16%
• Capacity Constraints 15%
• Travel Time 15%
• Numerical Experiment 14%
• Safety 12%
• Heuristics 10%
• Resources 8%
• Performance 5%

Social Sciences

• heuristics 63%
• scheduling 37%
• travel 29%
• resources 29%
• time 23%
• experiment 20%
• performance 15%

Engineering & Materials Science

• Heuristic methods 39%
• Travel time 35%
• Relaxation 31%
• Scheduling 23%
• Experiments 12%