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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gustavo Bergantiños / rank
Normal rank
 
Property / author
 
Property / author: María Gómez-Rúa / rank
Normal rank
 
Property / author
 
Property / author: Natividad Llorca / rank
Normal rank
 
Property / author
 
Property / author: Manuel A. Pulido / rank
Normal rank
 
Property / author
 
Property / author: Joaquín Sánchez-Soriano / rank
Normal rank
 
Property / author
 
Property / author: María Gómez-Rúa / rank
 
Normal rank
Property / author
 
Property / author: Natividad Llorca / rank
 
Normal rank
Property / author
 
Property / author: Manuel A. Pulido / rank
 
Normal rank
Property / author
 
Property / author: Joaquín Sánchez-Soriano / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2011.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055690105 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 11: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