The stochastic test collection problem: models, exact and heuristic solution approaches
From MaRDI portal
Publication:2670528
DOI10.1016/j.ejor.2021.12.043zbMath1495.90151OpenAlexW4206232212MaRDI QIDQ2670528
Tal Raviv, Yifat Douek-Pinkovich, Irad Ben-Gal
Publication date: 11 March 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.12.043
Integer programming (90C10) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensor placement for fault location identification in water networks: a minimum test cover approach
- Integer programming models for feature selection: new extensions and a randomized solution algorithm
- BGSA: Binary gravitational search algorithm
- Optimization of computer simulation models with rare events
- Approximation algorithms for the test cover problem
- GSA: A gravitational search algorithm
- Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
- Tabu Search—Part I