Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4170643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cost allocation: The traveling salesman, bin packing, and the knapsack |
scientific article; zbMATH DE number 4170643 |
Statements
Cost allocation: The traveling salesman, bin packing, and the knapsack (English)
0 references
1990
0 references
The cost allocation for the TSP is: Given an optimal tour, what portion of the total distance should/could be attributed to a particular city? The author examines the cost allocation issue for a number of combinatorial optimization problems, the main one being the TSP.
0 references
bin packing
0 references
knapsack
0 references
traveling salesman
0 references
cost allocation
0 references
0.7592189311981201
0 references
0.7440672516822815
0 references
0.7397875189781189
0 references
0.7397875189781189
0 references
0.7392908930778503
0 references
