Pages that link to "Item:Q3818091"

The following pages link to Algorithms for Voting and Competitive Location on a Network (Q3818091):

Displaying 21 items.

• Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations (Q323149) (← links)
• \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
• On discrete optimization with ordering (Q367635) (← links)
• Sequential competitive location on networks (Q439407) (← links)
• The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution (Q512989) (← links)
• An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
• Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
• On competitive sequential location in a network with a decreasing demand intensity (Q976444) (← links)
• \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
• How bad can a voting locating be (Q1082239) (← links)
• Sequential location problems (Q1278482) (← links)
• Perception and information in a competitive location model (Q1296002) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• A competitive facility location problem on a tree network with stochastic weights. (Q1811144) (← links)
• Relaxation of the Condorcet and Simpson conditions in voting location (Q1869503) (← links)
• Competitive location on a network (Q2367390) (← links)
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
• Condorcet winner configurations of linear networks (Q3577841) (← links)
• On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
• Conditional Location Problems on Networks and in the Plane (Q5506724) (← links)
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon (Q5852137) (← links)