On the public citation graph

On the core of routing games with revenues

https://doi.org/10.1007/s00182-009-0154-9
0 signed · 23 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01414209openalex-snapshot
A note on the 5-person traveling salesman game
inferredcites →https://doi.org/10.1007/bf01585702openalex-snapshot
Traveling salesman games
inferredcites →https://doi.org/10.1007/bf01681356openalex-snapshot
On the core of linear production games
inferredcites →https://doi.org/10.1007/bf01753311openalex-snapshot
A further note on the nucleoous of the “airport game”
inferredcites →https://doi.org/10.1007/s00182-006-0019-4openalex-snapshot
A Simple Algorithm for the Nucleolus of Airport Profit Games
inferredcites →https://doi.org/10.1007/s001820050025openalex-snapshot
On the Core of Routing Games
inferredcites →https://doi.org/10.1007/s00186-006-0088-yopenalex-snapshot
The nucleolus of trees with revenues
inferredcites →https://doi.org/10.1007/s10479-005-2249-4openalex-snapshot
Communication and Cooperation in Public Network Situations
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.1016/j.dam.2003.08.005openalex-snapshot
Traveling salesman games with the Monge property
inferredcites →https://doi.org/10.1016/j.ejor.2005.03.003openalex-snapshot
On the core of multiple longest traveling salesman games
inferredcites →https://doi.org/10.1057/jors.1986.93openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
inferredcites →https://doi.org/10.1080/00029890.1983.11971234openalex-snapshot
Fixed-Route Cost Allocation
inferredcites →https://doi.org/10.2307/2582681openalex-snapshot
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization.
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.2154836openalex-extracted
On the Core of Cost-Revenue Games: Minimum Cost Spanning Tree Games with Revenues
inferred← citeshttps://doi.org/10.1007/978-3-642-13725-9_2openalex-snapshot
Selected Topics in Cooperative Game Theory
inferred← citeshttps://doi.org/10.1007/s11590-019-01429-6openalex-snapshot
Cooperation of customers in traveling salesman problems with profits
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.01.056openalex-snapshot
On the core of cost-revenue games: Minimum cost spanning tree games with revenues
inferred← citeshttps://doi.org/10.1111/itor.12205openalex-snapshot
A review on cost allocation methods in collaborative transportation
inferred← citeshttps://doi.org/10.21923/jesd.829133openalex-snapshot
GEZGİN SATICI PROBLEMİNİN OYUN TEORİSİ MALİYET TAHSİS YÖNTEMLERİ İLE İNCELENMESİ
inferred← citeshttps://doi.org/10.3141/2609-09openalex-snapshot
Enabling a Freight Traffic Controller for Collaborative Multidrop Urban Logistics
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.