The traveling group problem
From MaRDI portal
Publication:2385125
Recommendations
Cites work
- A comparison of Dodgson's method and Kemeny's rule
- A dictionary for voting paradoxes
- A preference-based approach to spanning trees and shortest paths problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- Condorcet Social Choice Functions
- Fast Algorithms for Geometric Traveling Salesman Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1414348 (Why is no real title available?)
- Independence of Irrelevant Alternatives
- Signed orders and power set extensions
- Social choice and individual values
- The Borda dictionary
- The Dodgson ranking and its relation to Kemeny's method and Slater's rule
- The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
- The orienteering problem
- The traveling salesman problem and its variations
- Worst-case analysis of two travelling salesman heuristics
Cited in
(8)- A social choice approach to ordinal group activity selection
- Tour recommendation for groups
- Hedonic diversity games revisited
- Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations
- Committee selection under weight constraints
- Stability and welfare in (dichotomous) hedonic diversity games
- Collective decision making
- Closed paths in graphs vs. voting theory
This page was built for publication: The traveling group problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385125)