Pages that link to "Item:Q2892136"

The following pages link to Benders' cuts guided large neighborhood search for the traveling umpire problem (Q2892136):

Displayed 8 items.

• Decomposition and local search based methods for the traveling umpire problem (Q296910) ‎ (← links)
• Two exact algorithms for the traveling umpire problem (Q319246) ‎ (← links)
• Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem (Q322545) ‎ (← links)
• Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals (Q322736) ‎ (← links)
• Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392) ‎ (← links)
• On the complexity of the traveling umpire problem (Q476848) ‎ (← links)
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic (Q2356272) ‎ (← links)
• Referee assignment in the Chilean football league using integer programming and patterns (Q4980000) ‎ (← links)