An optimization approach to designing a baseball scout network

DOI10.1016/J.EJOR.2016.05.060zbMath1394.90298OpenAlexW2414785027MaRDI QIDQ1752145

Oğuzhan Özlü, Joel S. Sokol

Publication date: 24 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2016.05.060

zbMATH Keywords

heuristicsinteger programmingschedulingOR in sports

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Theory of organizations, manpower planning in operations research (90B70)

Uses Software

• VRP

Cites Work

• Decomposition and local search based methods for the traveling umpire problem
• Two exact algorithms for the traveling umpire problem
• Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
• Round robin scheduling -- a survey
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• A Primer in Column Generation

This page was built for publication: An optimization approach to designing a baseball scout network