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

Moshe Dror

doi:10.1016/0096-3003(90)90116-K

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

Moshe Dror

Management Information Systems

Research output: Contribution to journal › Article › peer-review

24 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 language	English (US)
Pages (from-to)	191-207
Number of pages	17
Journal	Applied Mathematics and Computation
Volume	35
Issue number	2
DOIs	https://doi.org/10.1016/0096-3003(90)90116-K
State	Published - Jan 1990

ASJC Scopus subject areas

Computational Mathematics
Applied Mathematics

Access to Document

10.1016/0096-3003(90)90116-K

Cite this

@article{ca8d8955a6bd46f484a810afb0d21598,

title = "Cost allocation: the traveling salesman, binpacking, and the knapsack",

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.",

author = "Moshe Dror",

year = "1990",

month = jan,

doi = "10.1016/0096-3003(90)90116-K",

language = "English (US)",

volume = "35",

pages = "191--207",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - Cost allocation

T2 - the traveling salesman, binpacking, and the knapsack

AU - Dror, Moshe

PY - 1990/1

Y1 - 1990/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/30244455175

UR - https://www.scopus.com/pages/publications/30244455175#tab=citedBy

U2 - 10.1016/0096-3003(90)90116-K

DO - 10.1016/0096-3003(90)90116-K

M3 - Article

AN - SCOPUS:30244455175

SN - 0096-3003

VL - 35

SP - 191

EP - 207

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 2

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this