On the public citation graph
A note on the 5-person traveling salesman game
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01585700openalex-snapshot
The traveling salesman problem in graphs with some excluded minors
inferredcites →https://doi.org/10.1016/0167-6377(89)90030-8openalex-snapshot
On the core of a traveling salesman cost allocation game
inferredcites →https://doi.org/10.1080/00029890.1983.11971234openalex-snapshot
Fixed-Route Cost Allocation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0770openalex-snapshot
Shipper And Carrier Collaboration
inferred← citeshttps://doi.org/10.1007/978-0-387-77247-9_9openalex-snapshot
Cost Allocation in Combinatorial Optimization Games
inferred← citeshttps://doi.org/10.1007/978-3-030-64018-7_20openalex-snapshot
Collaboration in Transport and Logistics Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-35822-7_4openalex-snapshot
Selected Topics in Cooperative Game Theory
inferred← citeshttps://doi.org/10.1007/bf01545526openalex-snapshot
On approximately fair cost allocation in Euclidean TSP games
inferred← citeshttps://doi.org/10.1007/bf02579075openalex-snapshot
Operations research games: A survey
inferred← citeshttps://doi.org/10.1007/s00182-009-0154-9openalex-snapshot
On the core of routing games with revenues
inferred← citeshttps://doi.org/10.1007/s00182-011-0285-7openalex-snapshot
Characterizing the Shapley value in fixed-route traveling salesman problems with appointments
inferred← citeshttps://doi.org/10.1016/j.dam.2003.08.005openalex-snapshot
Traveling salesman games with the Monge property
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.020openalex-snapshot
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.03.003openalex-snapshot
On the core of multiple longest traveling salesman games
inferred← citeshttps://doi.org/10.1016/j.orl.2015.04.008openalex-snapshot
On the core of traveling salesman games
inferred← citeshttps://doi.org/10.1023/a:1018935324969openalex-snapshot
The traveling salesman game: An application ofcost allocation in a gas and oil company
inferred← citeshttps://doi.org/10.1145/1807406.1807484openalex-snapshot
Some new cooperative coverage facility location games
inferred← citeshttps://doi.org/10.1155/2014/107102openalex-snapshot
Developing a Collaborative Planning Framework for Sustainable Transportation
inferred← citeshttps://doi.org/10.1287/opre.1120.1130openalex-snapshot
Allocating Cost of Service to Customers in Inventory Routing
inferred← citeshttps://doi.org/10.1587/transinf.2024fcl0001openalex-snapshot
The Least Core of Routing Game without Triangle Inequality
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.