Cost allocation: the traveling salesman, binpacking, and the knapsack
- 1 January 1990
- journal article
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 35 (2) , 191-207
- https://doi.org/10.1016/0096-3003(90)90116-k
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Inventory/routing: Reduction from an annual to a short-period problemNaval Research Logistics (NRL), 1987
- Game Theory and Cost Allocation ProblemsManagement Science, 1986
- Fixed-Route Cost AllocationThe American Mathematical Monthly, 1983
- Cores of convex gamesInternational Journal of Game Theory, 1971
- Least d-Majorized Network Flows with Inventory and Statistical ApplicationsManagement Science, 1971
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960