Heuristic solutions and confidence intervals for the multicovering problem
From MaRDI portal
Publication:579132
DOI10.1016/0377-2217(87)90142-1zbMath0624.90073OpenAlexW2081000990MaRDI QIDQ579132
Sue P. Siferd, David J. Gonsalvez, WanSoo T. Rhee, Nicholas G. Hall
Publication date: 1987
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(87)90142-1
Related Items (3)
A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ Confidence in heuristic solutions?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the quality of heuristic solutions to a 19\(\times 19\) quadratic assignment problem
- An efficient heuristic for large set covering problems
- Using Confidence Limits for the Global Optimum in Combinatorial Optimization
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Procedures for Estimating Optimal Solution Values for Large Combinatorial Problems
- Interval estimation of a global optimum for large combinatorial problems
This page was built for publication: Heuristic solutions and confidence intervals for the multicovering problem