Efficient sequential decision-making algorithms for container inspection operations
From MaRDI portal
Publication:2892126
DOI10.1002/nav.20472zbMath1245.90021OpenAlexW2101283892MaRDI QIDQ2892126
Fred S. Roberts, Sushil Kumar Mittal, David Madigan
Publication date: 18 June 2012
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20472
heuristic algorithmsbinary decision treeBoolean functionsequential decision makingcontainer inspection
Decision theory (91B06) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (4)
Interpretable classifiers using rules and Bayesian analysis: building a better stroke prediction model ⋮ Moments and distribution of the net present value of a serial project ⋮ Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods ⋮ Computer science and decision theory
Cites Work
- Optimal sequential inspection policies
- On the tour planning problem
- Integer programming models for deployment of airport baggage screening security devices
- The comparison between classification trees through proximity measures
- Constructing optimal binary decision trees is NP-complete
- A large‐scale linear programming model for finding optimal container inspection strategies
This page was built for publication: Efficient sequential decision-making algorithms for container inspection operations
