Pages that link to "Item:Q1122517"

The following pages link to On the core of a traveling salesman cost allocation game (Q1122517):

Displaying 29 items.

• Characterizing the Shapley value in fixed-route traveling salesman problems with appointments (Q422367) (← links)
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
• On the core of routing games with revenues (Q532673) (← links)
• On the core of network synthesis games (Q757264) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
• The core of some location games (Q1182211) (← links)
• Traveling salesman games (Q1184345) (← links)
• Cost allocation in the Chinese postman problem (Q1307816) (← links)
• Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
• On the core of routing games (Q1358628) (← links)
• On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
• On the equivalence between some local and global Chinese postman and traveling salesman graphs (Q1421461) (← links)
• On the submodularity of multi-depot traveling salesman games (Q1727725) (← links)
• On the core of traveling salesman games (Q1785381) (← links)
• Compromise values in cooperative game theory (Q1804555) (← links)
• Traveling salesman games with the Monge property (Q1827808) (← links)
• On the nucleolus of the basic vehicle routing game (Q1919815) (← links)
• Minimum cost spanning tree games and spillover stability (Q1934274) (← links)
• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
• Cooperation of customers in traveling salesman problems with profits (Q2191292) (← links)
• On the core of multiple longest traveling salesman games (Q2503251) (← links)
• New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
• A review on cost allocation methods in collaborative transportation (Q2811933) (← links)
• COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
• Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation (Q2960364) (← links)
• A note on the 5-person traveling salesman game (Q3142153) (← links)
• On some approximately balanced combinatorial cooperative games (Q3142154) (← links)
• Juegos con corazon no vacio. Una nueva caracterizacion (Q3354492) (← links)
• Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation (Q4971567) (← links)