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

Research output: Contribution to journalArticle

15 Citations (Scopus)

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 - 1990
Externally publishedYes

Fingerprint

Cost Allocation
Travelling salesman
Bin Packing
Knapsack
Traveling salesman problem
Travelling salesman problems
Costs
Knapsack Problem
Triangular

ASJC Scopus subject areas

  • Applied Mathematics
  • Computational Mathematics
  • Numerical Analysis

Cite this

Cost allocation : the traveling salesman, binpacking, and the knapsack. / Dror, Moshe.

In: Applied Mathematics and Computation, Vol. 35, No. 2, 1990, p. 191-207.

Research output: Contribution to journalArticle

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

Y1 - 1990

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

VL - 35

SP - 191

EP - 207

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

SN - 0096-3003

IS - 2

ER -