Dynamic programming for the stochastic matching model on general graphs: the case of the `N-graph' (Q6520139)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic programming for the stochastic matching model on general graphs: the case of the `N-graph' |
scientific article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic programming for the stochastic matching model on general graphs: the case of the `N-graph' |
scientific article from arXiv |
Statements
Dynamic programming for the stochastic matching model on general graphs: the case of the `N-graph' (English)
0 references
