Multiple voting location and single voting location on trees (Q877040): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Relaxation of the Condorcet and Simpson conditions in voting location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maxima of a Set of Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Coverage Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank

Latest revision as of 16:47, 25 June 2024

scientific article
Language Label Description Also known as
English
Multiple voting location and single voting location on trees
scientific article

    Statements

    Multiple voting location and single voting location on trees (English)
    0 references
    0 references
    0 references
    0 references
    19 April 2007
    0 references
    group decisions and negotiations
    0 references
    facility location
    0 references
    Condorcet
    0 references
    Simpson score
    0 references
    efficient graph algorithms
    0 references

    Identifiers