An optimization approach to designing a baseball scout network
DOI10.1016/J.EJOR.2016.05.060zbMATH Open1394.90298OpenAlexW2414785027MaRDI QIDQ1752145FDOQ1752145
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
Recommendations
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)
Cites Work
- The vehicle routing problem: An overview of exact and approximate algorithms
- Branch-and-price: Column generation for solving huge integer programs
- A Primer in Column Generation
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic
- 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
- Round robin scheduling -- a survey
Cited In (1)
Uses Software
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)