Cost allocation: the traveling salesman, binpacking, and the knapsack

Research output: Contribution to journalArticle

15 Scopus citations

Abstract

We examine the problem of cost allocation for the traveling-salesman problem (TSP). We note the significance of a "home" city in the TSP for designing cost allocation schemes, focusing on TSPs with triangular inequality. In addition, a similar cost allocation question is stated for the binpacking and the knapsack problems.

Original languageEnglish (US)
Pages (from-to)191-207
Number of pages17
JournalApplied Mathematics and Computation
Volume35
Issue number2
DOIs
StatePublished - Jan 1990
Externally publishedYes

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Cost allocation: the traveling salesman, binpacking, and the knapsack'. Together they form a unique fingerprint.

  • Cite this