Algorithmic Cost Allocation Games: Theory and Applications (Q5176374): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computation of the nucleolus of a cooperative game / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Note on the computational complexity of least core concepts for min-cost spanning tree games. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach / rank | |||
Normal rank | |||
Latest revision as of 19:20, 9 July 2024
scientific article; zbMATH DE number 6410652
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic Cost Allocation Games: Theory and Applications |
scientific article; zbMATH DE number 6410652 |
Statements
Algorithmic Cost Allocation Games: Theory and Applications (English)
0 references
3 March 2015
0 references
0 references
