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 - http://www.scopus.com/inward/record.url?scp=30244455175&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=30244455175&partnerID=8YFLogxK
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 -