Stable source connection and assignment problems as multi-period shortest path problems (Q6665449)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7969308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Stable source connection and assignment problems as multi-period shortest path problems |
scientific article; zbMATH DE number 7969308 |
Statements
Stable source connection and assignment problems as multi-period shortest path problems (English)
0 references
17 January 2025
0 references
shortest path
0 references
demand over multiple periods
0 references
cooperative game
0 references
core
0 references
total balancedness
0 references
source-connection
0 references
assignment
0 references
0.7693488597869873
0 references
0.7535768151283264
0 references
0.7490463256835938
0 references
0.7398765087127686
0 references
0.7334497570991516
0 references
