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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximating \(k\)-hop minimum-spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fair rule in minimum cost spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cost allocation for a spanning tree: A game theoretic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research games: A survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost monotonicity, consistency and minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the core and nucleolus of minimum cost spanning tree games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey. / rank
 
Normal rank

Latest revision as of 10:16, 5 July 2024

scientific article
Language Label Description Also known as
English
A cost allocation rule for \(k\)-hop minimum cost spanning tree problems
scientific article

    Statements

    Identifiers