Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem (Q4027794): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/moor.17.4.765 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2124174877 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem |
scientific article |
Statements
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem (English)
0 references
1 March 1993
0 references
facility location
0 references
undirected connected graph
0 references
fixed cost spanning forest problem
0 references
fixed cost spanning forest game
0 references
core
0 references
nucleolus
0 references
