Two exact algorithms for the traveling umpire problem
From MaRDI portal
Publication:319246
DOI10.1016/J.EJOR.2014.12.038zbMath1346.90476OpenAlexW2005799457MaRDI QIDQ319246
Li Xue, Zhi-Xing Luo, Andrew E. B. Lim
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.12.038
Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Related Items (7)
Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America ⋮ Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem ⋮ Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm ⋮ An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs ⋮ The sport teams grouping problem ⋮ An optimization approach to designing a baseball scout network ⋮ A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
Cites Work
- Unnamed Item
- Decomposition and local search based methods for the traveling umpire problem
- On the complexity of the traveling umpire problem
- On a multicriteria shortest path problem
- A multicriteria Pareto-optimal path algorithm
- A label-setting algorithm for finding a quickest path
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Benders' cuts guided large neighborhood search for the traveling umpire problem
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Path inequalities for the vehicle routing problem with time windows
- Column Generation
- Selected Topics in Column Generation
This page was built for publication: Two exact algorithms for the traveling umpire problem
