Pages that link to "Item:Q922949"
From MaRDI portal
The following pages link to Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949):
Displaying 11 items.
- Some characterizations of (strongly) subadditive discounting functions (Q279920) (← links)
- Collaborative transportation with overlapping coalitions (Q724085) (← links)
- Cooperative maximum-flow problem under uncertainty in logistic networks (Q902866) (← links)
- On the core of a traveling salesman cost allocation game (Q1122517) (← links)
- On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
- Cooperative and axiomatic approaches to the knapsack allocation problem (Q2095938) (← links)
- Knapsack cost sharing (Q2254240) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- A review on cost allocation methods in collaborative transportation (Q2811933) (← links)
- Collaboration in Cargo Transportation (Q3638512) (← links)
- Consolidation in Urban Freight Transportation — Cost Allocation Models (Q4689381) (← links)