Pages that link to "Item:Q1384221"

The following pages link to On approximately fair cost allocation in Euclidean TSP games (Q1384221):

Displaying 26 items.

• Approximate core allocations and integrality gap for the bin packing game (Q265072) (← links)
• A system-theoretic model for cooperation, interaction and allocation (Q643011) (← links)
• On the complexity of core, kernel, and bargaining set (Q650525) (← links)
• The indefinite period traveling salesman problem (Q724039) (← links)
• Cost allocation: The traveling salesman, bin packing, and the knapsack (Q922949) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
• The travelling preacher, projection, and a lower bound for the stability number of a graph (Q951102) (← links)
• Cooperative TSP (Q982655) (← links)
• Traveling salesman games (Q1184345) (← links)
• On the submodularity of multi-depot traveling salesman games (Q1727725) (← links)
• On the core of traveling salesman games (Q1785381) (← links)
• Proportional allocation schemes for tour costs (Q1820664) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• Strategic cooperation in cost sharing games (Q1939521) (← links)
• The traveling salesman game for cost allocation: the case study of the bus service in Castellanza (Q2018968) (← links)
• Computing Shapley values in the plane (Q2118220) (← links)
• Approximation of the Shapley value for the Euclidean travelling salesman game (Q2158624) (← links)
• Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value (Q2289024) (← links)
• Geometric spanner games (Q2330124) (← links)
• New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
• A review on cost allocation methods in collaborative transportation (Q2811933) (← links)
• Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
• (Q5088947) (← links)
• Approximate core allocations for edge cover games (Q6122606) (← links)
• Approximate core allocations for edge cover games (Q6535804) (← links)
• Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)