Paul, Alice; Freund, Daniel; Ferber, Aaron; Shmoys, David B.; Williamson, David P. Erratum to: “Budgeted prize-collecting traveling salesman and minimum spanning tree problems”. (English) Zbl 07811862 Math. Oper. Res. 48, No. 4, 2304-2307 (2023). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{A. Paul} et al., Math. Oper. Res. 48, No. 4, 2304--2307 (2023; Zbl 07811862) Full Text: DOI
Paul, Alice; Freund, Daniel; Ferber, Aaron; Shmoys, David B.; Williamson, David P. Budgeted prize-collecting traveling salesman and minimum spanning tree problems. (English) Zbl 1456.90137 Math. Oper. Res. 45, No. 2, 576-590 (2020); erratum ibid. 48, No. 4, 2304-2307 (2023). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{A. Paul} et al., Math. Oper. Res. 45, No. 2, 576--590 (2020; Zbl 1456.90137) Full Text: DOI Link
Levi, Retsef; Roundy, Robin O.; Shmoys, David B. Provably near-optimal sampling-based policies for stochastic inventory control models. (English) Zbl 1341.90005 Math. Oper. Res. 32, No. 4, 821-839 (2007). MSC: 90B05 62D05 PDFBibTeX XMLCite \textit{R. Levi} et al., Math. Oper. Res. 32, No. 4, 821--839 (2007; Zbl 1341.90005) Full Text: DOI
Levi, Retsef; Pál, Martin; Roundy, Robin O.; Shmoys, David B. Approximation algorithms for stochastic inventory control models. (English) Zbl 1279.90011 Math. Oper. Res. 32, No. 2, 284-302 (2007). MSC: 90B05 93E20 PDFBibTeX XMLCite \textit{R. Levi} et al., Math. Oper. Res. 32, No. 2, 284--302 (2007; Zbl 1279.90011) Full Text: DOI Link
Levi, Retsef; Roundy, Robin O.; Shmoys, David B. Primal-dual algorithms for deterministic inventory problems. (English) Zbl 1278.90026 Math. Oper. Res. 31, No. 2, 267-284 (2006). MSC: 90B05 PDFBibTeX XMLCite \textit{R. Levi} et al., Math. Oper. Res. 31, No. 2, 267--284 (2006; Zbl 1278.90026) Full Text: DOI
Hall, Leslie A.; Schulz, Andreas S.; Shmoys, David B.; Wein, Joel Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. (English) Zbl 0883.90064 Math. Oper. Res. 22, No. 3, 513-544 (1997). MSC: 90B35 90C27 90C05 PDFBibTeX XMLCite \textit{L. A. Hall} et al., Math. Oper. Res. 22, No. 3, 513--544 (1997; Zbl 0883.90064) Full Text: DOI Link
Plotkin, Serge A.; Shmoys, David B.; Tardos, Éva Fast approximation algorithms for fractional packing and covering problems. (English) Zbl 0837.90103 Math. Oper. Res. 20, No. 2, 257-301 (1995). MSC: 90C27 90C10 90B10 90C08 PDFBibTeX XMLCite \textit{S. A. Plotkin} et al., Math. Oper. Res. 20, No. 2, 257--301 (1995; Zbl 0837.90103) Full Text: DOI Link
Hall, Leslie A.; Shmoys, David B. Jackson’s rule for single-machine scheduling: Making a good heuristic better. (English) Zbl 0781.90052 Math. Oper. Res. 17, No. 1, 22-35 (1992). Reviewer: R.Słowinski (Poznań) MSC: 90B35 90-08 PDFBibTeX XMLCite \textit{L. A. Hall} and \textit{D. B. Shmoys}, Math. Oper. Res. 17, No. 1, 22--35 (1992; Zbl 0781.90052) Full Text: DOI Link
Hochbaum, Dorit S.; Shmoys, David B. A best possible heuristic for the k-center problem. (English) Zbl 0565.90015 Math. Oper. Res. 10, 180-184 (1985). MSC: 90B05 68Q25 05C35 65K05 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{D. B. Shmoys}, Math. Oper. Res. 10, 180--184 (1985; Zbl 0565.90015) Full Text: DOI