EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Stochastic Optimization and Learning for Two-Stage Supplier Problems

Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti

ACM Transactions on Probabilistic Machine Learning · 2025

DOI: 10.1145/3604619 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Probabilistic Machine Learning, 2025. Verfasst von Brian Brubach und 5 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science Foundation, Amazon, Adobe.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The main focus of this article is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the form of a budget constraint. In addition to the standard (homogeneous) setting where all clients must be within a distance \(R\) of the nearest facility, we provide results for the more general problem where the radius demands may be inhomogeneous (i.e., different for each client). We also explore a number of variants where additional constraints are imposed on the first-stage decisions, specifically matroid and multi-knapsack constraints, and provide results for these settings. We derive results for the most general distributional setting, where there is only black-box access to the underlying distribution. To accomplish this, we first develop algorithms for the polynomial scenarios setting; we then employ a novel scenario-discarding variant of the standard Sample Average Approximation method, which crucially exploits properties of the restricted-case algorithms. We note that the scenario-discarding modification to the SAA method is necessary to optimize over the radius.

Förderung

  • National Science Foundation
  • Amazon
  • Adobe
  • Google

Zitieren

APA

Brubach, B., Grammel, N., Harris, D. G., Srinivasan, A., Tsepenekas, L., & Vullikanti, A. (2025). Stochastic Optimization and Learning for Two-Stage Supplier Problems. ACM Transactions on Probabilistic Machine Learning. https://doi.org/10.1145/3604619

Vancouver

Brubach B, Grammel N, Harris DG, Srinivasan A, Tsepenekas L, Vullikanti A. Stochastic Optimization and Learning for Two-Stage Supplier Problems. ACM Transactions on Probabilistic Machine Learning. 2025. doi:10.1145/3604619

BibTeX
@article{Brubach2025,
  author = {Brubach, Brian and Grammel, Nathaniel and Harris, David G. and Srinivasan, Aravind and Tsepenekas, Leonidas and Vullikanti, Anil},
  title = {Stochastic Optimization and Learning for Two-Stage Supplier Problems},
  journal = {ACM Transactions on Probabilistic Machine Learning},
  year = {2025},
  doi = {10.1145/3604619}
}
Kostenlos starten →