The traveling group problem (Q2385125)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The traveling group problem	scientific article

Statements

scholarly article

0 references

The traveling group problem (English)

0 references

Christian Klamler

0 references

Ulrich Pferschy

0 references

Social Choice and Welfare

0 references

publication date

11 October 2007

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00355-006-0214-z

0 references

0 references

Fast Algorithms for Geometric Traveling Salesman Problems

0 references

The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm

0 references

Condorcet Social Choice Functions

0 references

Signed orders and power set extensions

0 references

0 references

The orienteering problem

0 references

The traveling salesman problem and its variations

0 references

The Dodgson ranking and its relation to Kemeny's method and Slater's rule

0 references

0 references

Worst-case analysis of two travelling salesman heuristics

0 references

A preference-based approach to spanning trees and shortest paths problems

0 references

A comparison of Dodgson's method and Kemeny's rule

0 references

Independence of Irrelevant Alternatives

0 references

An Analysis of Several Heuristics for the Traveling Salesman Problem

0 references

A dictionary for voting paradoxes

0 references

The Borda dictionary

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00355-006-0214-z

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2385125

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2385125&oldid=35011278"