Optimal batting orders in one-day cricket

DOI10.1016/J.COR.2004.09.031zbMATH Open1090.90197OpenAlexW2099996862MaRDI QIDQ2583773FDOQ2583773

Authors: Paramjit S. Gill, David Beaudoin, Tim B. Swartz, Basil M. de Silva 

Publication date: 18 January 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.031

Recommendations

• OPTIMAL STRATEGIES IN ONE-DAY CRICKET
• An optimisation model to determine batting order in baseball
• Modelling and simulation for one‐day cricket
• A criterion for comparing and selecting batsmen in limited overs cricket
• scientific article; zbMATH DE number 1234738

zbMATH Keywords

simulated annealinglog-linear modelsMonte Carlo simulationMarkov chain methodswinbugs software

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Markov and semi-Markov decision processes (90C40)

Cites Work

• Optimization by simulated annealing
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fair method for resetting the target in interrupted one-day cricket matches

Cited In (11)

• OPTIMAL STRATEGIES IN ONE-DAY CRICKET
• Optimizing strategic behaviour in a dynamic setting in professional team sports
• A study of the powerplay in one-day cricket
• An optimisation model to determine batting order in baseball
• To run or not?: Some dynamic programming models in cricket
• Modelling and simulation for one‐day cricket
• A truncated mean-parameterized Conway-Maxwell-Poisson model for the analysis of test match bowlers
• Dynamic programming in cricket: choosing a night watchman
• Contextual batting and bowling in limited overs cricket
• Optimal lineups in Twenty20 cricket
• An objective approach of balanced cricket team selection using binary integer programming method

Uses Software

• WinBUGS

This page was built for publication: Optimal batting orders in one-day cricket

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