An optimization approach to designing a baseball scout network

DOI10.1016/J.EJOR.2016.05.060MaRDI QIDQ1752145zbMATHOpenAlexFDO

Authors Oğuzhan Özlü, Joel 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

heuristicsOR in sportsinteger programmingscheduling

Mathematics Subject Classification ID

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

Recommendations

• Devising a Cost Effective Schedule for a Baseball League
• A Markov Chain Approach to Baseball
• An optimisation model to determine batting order in baseball
• Sports scheduling: problems and applications
• Organization of a college baseball tournament

Cites work

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

Cited in

(1)

• An optimisation model to determine batting order in baseball

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752145)