On the public citation graph

Chinese postman games with repeated players

https://doi.org/10.2139/ssrn.3278565
0 signed · 19 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/nav.3800140404openalex-extracted
On balanced sets and cores
inferredcites →https://doi.org/10.1007/bf01580113openalex-extracted
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1007/bf02579075openalex-extracted
Operations research games: A survey
inferredcites →https://doi.org/10.1007/s001860300284openalex-extracted
Submodularity of some classes of the combinatorial optimization games
inferredcites →https://doi.org/10.1007/s10107-013-0655-yopenalex-extracted
Monotonic stable solutions for minimum coloring games
inferredcites →https://doi.org/10.1007/s101070050005openalex-extracted
Totally balanced combinatorial optimization games
inferredcites →https://doi.org/10.1007/s101070050093openalex-extracted
On some balanced, totally balanced and submodular delivery games
inferredcites →https://doi.org/10.1007/s10479-007-0237-6openalex-extracted
Sequencing games with repeated players
inferredcites →https://doi.org/10.1007/s10479-015-1977-3openalex-extracted
On games arising from multi-depot Chinese postman problems
inferredcites →https://doi.org/10.1016/j.dam.2012.04.002openalex-extracted
On graphs which can or cannot induce Chinese Postman games with a non-empty core
inferredcites →https://doi.org/10.1016/j.dam.2014.03.002openalex-extracted
Graphs Inducing Totally Balanced and Submodular Chinese Postman Games
inferredcites →https://doi.org/10.1016/j.geb.2010.02.002openalex-extracted
On Chinese postman games where residents of each road pay the cost of their road
inferredcites →https://doi.org/10.1016/j.orl.2005.01.007openalex-extracted
Job scheduling, cooperation, and control
inferredcites →https://doi.org/10.1016/s0166-218x(03)00225-7openalex-extracted
On the equivalence between some local and global Chinese postman and traveling salesman graphs
inferredcites →https://doi.org/10.1016/s0377-2217(96)00015-xopenalex-extracted
On the concavity of delivery games
inferredcites →https://doi.org/10.1016/s0377-2217(98)00310-5openalex-extracted
Cost allocation in the Chinese postman problem
inferredcites →https://doi.org/10.1090/s0002-9939-1995-1260169-4openalex-extracted
Characterizations of naturally submodular graphs: a polynomially solvable class of the TSP
inferredcites →https://doi.org/10.1142/s021919890900211xopenalex-extracted
ASSIGNMENT SITUATIONS WITH MULTIPLE OWNERSHIP AND THEIR GAMES
inferredcites →https://doi.org/10.1002/net.20093openalex-snapshot
Fixed tree games with multilocated players
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.