scientific article; zbMATH DE number 4119984

MaRDI QIDQ4733704zbMATH OpenFDO

Authors Jos Potters

Publication date 1989

zbMATH Keywords

balanced TS-gamescombinatorial cooperative gamescost allocationcost matricesnon-empty coreTraveling salesman games

Mathematics Subject Classification ID

Cooperative games (91A12)

Recommendations

• Traveling salesman games
• On the core of a traveling salesman cost allocation game
• Approximately fair cost allocation in metric traveling salesman games
• Approximation and Online Algorithms
• Traveling salesman games with the Monge property

Cited in

(10)

• On the core of a traveling salesman cost allocation game
• Traveling salesman games
• On the submodularity of multi-depot traveling salesman games
• Traveling salesman games with the Monge property
• Cooperation of customers in traveling salesman problems with profits
• A note on the 5-person traveling salesman game
• Core-based cost allocation in the cooperative traveling salesman problem
• Coincidence of cooperative game theoretic solutions in the appointment problem
• Approximation and Online Algorithms
• Approximately fair cost allocation in metric traveling salesman games

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733704)