Investigation on irreducible cost vectors in minimum cost arborescence problems
DOI10.1016/J.EJOR.2017.01.041zbMATH Open1403.91214OpenAlexW2580546709MaRDI QIDQ1753571FDOQ1753571
Authors: Yoshifumi Kusunoki, Tetsuzo Tanino 
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.01.041
Recommendations
Cooperative games (91A12) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Combinatorial optimization. Theory and algorithms.
- Sharing a minimal cost spanning tree: beyond the folk solution
- Optimum branchings
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- Minimum cost arborescences
- The \(P\)-value for cost sharing in minimum
- Characterization of monotonic rules in minimum cost spanning tree problems
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Equivalent representations of set functions
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- On obligation rules for minimum cost spanning tree problems
- The optimistic \(TU\) game in minimum cost spanning tree problems
- Robustness of minimum cost arborescences
Cited In (2)
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)
