Investigation on irreducible cost vectors in minimum cost arborescence problems
From MaRDI portal
Publication:1753571
Recommendations
Cites work
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- Characterization of monotonic rules in minimum cost spanning tree problems
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Combinatorial optimization. Theory and algorithms.
- Equivalent representations of set functions
- Minimum cost arborescences
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- On obligation rules for minimum cost spanning tree problems
- Optimum branchings
- Robustness of minimum cost arborescences
- Sharing a minimal cost spanning tree: beyond the folk solution
- The \(P\)-value for cost sharing in minimum
- The optimistic \(TU\) game in minimum cost spanning tree problems
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
This page was built for publication: Investigation on irreducible cost vectors in minimum cost arborescence problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753571)