Random sampling and machine learning to understand good decompositions
Year of publication: |
2020
|
---|---|
Authors: | Basso, S. ; Ceselli, A. ; Tettamanzi, A. |
Published in: |
Decomposition methods for hard optimization problems. - New York, NY, USA : Springer. - 2020, p. 501-526
|
Subject: | Dantzig-Wolfe decomposition | Machine learning | Random sampling | Stichprobenerhebung | Sampling | Künstliche Intelligenz | Artificial intelligence | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Lernprozess | Learning process |
-
Breaking the sample size barrier in model-based reinforcement learning with a generative model
Li, Gen, (2024)
-
Is Q-learning minimax optimal? : a tight sample complexity analysis
Li, Gen, (2024)
-
Data-driven stochastic vehicle routing problems with deadlines
Wang, Shanshan, (2024)
- More ...
-
Modeling and solving profitable location and distribution problems
Ceselli, A., (2013)
- More ...