A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2011.11.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2055690105
@@ Property / OpenAlex ID: W2055690105 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating \(k\)-hop minimum-spanning trees
@@ Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+A fair rule in minimum cost spanning tree problems
+Normal rank
@@ Property / cites work @@
+On cost allocation for a spanning tree: A game theoretic approach
+Normal rank
@@ Property / cites work @@
+Operations research games: A survey. (With comments and rejoinder)
+Normal rank
@@ Property / cites work @@
+Cost monotonicity, consistency and minimum cost spanning tree games
+Normal rank
@@ Property / cites work @@
+Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
+Normal rank
@@ Property / cites work @@
+On the core and nucleolus of minimum cost spanning tree games
+Normal rank
@@ Property / cites work @@
+Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey.
+Normal rank