Koc University Digital Collections
metadata only
Structural properties of a class of robust inventory and queueing control problems
In standard stochastic dynamic programming, the transition probability distributions of the underlying Markov Chains are assumed to be known with certainty. We focus on the case where the transition probabilities or other input data are uncertain. Robust dynamic programming addresses this problem by
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Structural properties of a class of robust inventory and queueing control problems#955771
- A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty#793567
- A Parametrized Complexity View on Robust Scheduling with Budgeted Uncertainty#789563
- Adjustable Robust Optimization with Discrete Uncertainty#796345
- Simulasi Sistem Antrian M/M/1 Menggunakan Python: Analisis Kinerja dengan Metode Discrete-Event Simulation (DES)#1066853
Record · ID 955794
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive