Cost allocation: The traveling salesman, bin packing, and the knapsack

DOI10.1016/0096-3003(90)90116-KzbMath0711.90056MaRDI QIDQ922949

Moshe Dror

Publication date: 1990

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

traveling salesmancost allocationknapsackbin packing

Mathematics Subject Classification ID

Integer programming (90C10) Cooperative games (91A12) Combinatorial optimization (90C27)

Related Items

Some characterizations of (strongly) subadditive discounting functions ⋮ On the core of a traveling salesman cost allocation game ⋮ On the nucleolus of the basic vehicle routing game ⋮ A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ Knapsack cost sharing ⋮ Collaborative transportation with overlapping coalitions ⋮ Consolidation in Urban Freight Transportation — Cost Allocation Models ⋮ A review on cost allocation methods in collaborative transportation ⋮ Collaboration in Cargo Transportation ⋮ Cooperative and axiomatic approaches to the knapsack allocation problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cores of convex games
• Integer Programming Formulation of Traveling Salesman Problems
• Fixed-Route Cost Allocation
• Game Theory and Cost Allocation Problems
• Least d-Majorized Network Flows with Inventory and Statistical Applications