On the public citation graph
On the Windy Postman Problem on eulerian graphs
0 signed · 53 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/bf01580113openalex-snapshot
Matching, Euler tours and the Chinese postman
inferredcites →https://doi.org/10.1016/0166-218x(79)90016-7openalex-snapshot
The mixed postman problem
inferredcites →https://doi.org/10.1016/0166-218x(84)90089-1openalex-snapshot
On the windy postman problem
inferredcites →https://doi.org/10.1137/0606065openalex-snapshot
Eulerian Orientations and Circulations
inferredcites →https://doi.org/10.1145/322139.322150openalex-snapshot
Approximation Algorithms for Some Postman Problems
inferredcites →https://doi.org/10.1287/mnsc.25.7.643openalex-snapshot
The Chinese Postman Problem for Mixed Networks
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.eorms0142openalex-snapshot
C hinese Postman Problem
inferred← citeshttps://doi.org/10.1002/net.20347openalex-snapshot
Recent results on Arc Routing Problems: An annotated bibliography
inferred← citeshttps://doi.org/10.1002/net.21730openalex-snapshot
Partitioning a street network into compact, balanced, and visually appealing routes
inferred← citeshttps://doi.org/10.1002/net.21987openalex-snapshot
Plowing with precedence in polynomial time
inferred← citeshttps://doi.org/10.1002/net.22171openalex-snapshot
The single robot line coverage problem: Theory, algorithms, and experiments
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_1openalex-snapshot
A Historical Perspective on Arc Routing
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_11openalex-snapshot
Scheduling of Local Delivery Carrier Routes for the United States Postal Service
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_4openalex-snapshot
Arc Routing: Complexity and Approximability
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_6openalex-snapshot
Polyhedral Theory for Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-66723-8_32openalex-snapshot
Approximation Algorithms for the Single Robot Line Coverage Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-44003-3_5openalex-snapshot
Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs
inferred← citeshttps://doi.org/10.1007/978-981-95-4839-2_23openalex-snapshot
On the Windy k-Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bf01581206openalex-snapshot
A cutting plane algorithm for the windy postman problem
inferred← citeshttps://doi.org/10.1007/s10107-010-0399-xopenalex-snapshot
New results on the Windy Postman Problem
inferred← citeshttps://doi.org/10.1007/s10287-009-0119-2openalex-snapshot
A metaheuristic for the min–max windy rural postman problem with K vehicles
inferred← citeshttps://doi.org/10.1007/s12532-019-00155-5openalex-snapshot
OAR Lib: an open source arc routing library
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90073-6openalex-snapshot
Solvable cases of the k-person Chinese postman problem
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90079-5openalex-snapshot
Algorithms for the Windy Postman Problem
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2022.107755openalex-snapshot
A distributed message passing algorithm for the capacitated directed Chinese postman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2004.04.007openalex-snapshot
New heuristic algorithms for the windy rural postman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.10.013openalex-snapshot
Plowing with precedence: A variant of the windy postman problem
inferred← citeshttps://doi.org/10.1016/j.cor.2025.107327openalex-snapshot
Time-dependent Windy Rural Postman Problem: Mathematical formulation and adaptive metaheuristic
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.062openalex-snapshot
Series–parallel graphs are windy postman perfect
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.09.021openalex-snapshot
Lower bounds and heuristics for the Windy Rural Postman Problem
inferred← citeshttps://doi.org/10.1016/j.orl.2020.03.012openalex-snapshot
Postman problems on series–parallel mixed graphs
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80109-4openalex-snapshot
Chapter 5 Arc routing methods and applications
inferred← citeshttps://doi.org/10.1023/a:1018350224084openalex-snapshot
Finding Postal Carrier Walk Paths in Mixed Graphs
inferred← citeshttps://doi.org/10.1051/ro/2012004openalex-snapshot
A branch-and-price algorithm for the windy rural postman problem
inferred← citeshttps://doi.org/10.1109/enc.2006.9openalex-snapshot
Complexity of the Mixed Postman Problem with Restrictions on the Edges
inferred← citeshttps://doi.org/10.1109/iceee.2014.6978276openalex-snapshot
Approximation algorithms for the Street sweeping problem
inferred← citeshttps://doi.org/10.1109/tsmc.2023.3270308openalex-snapshot
Fast Vehicle Routing via Knowledge Transfer in a Reproducing Kernel Hilbert Space
inferred← citeshttps://doi.org/10.1109/vppc.2007.4544235openalex-snapshot
Optimality and Reachability - Pseudo Boolean Power Flows for multi-sourced Vehicle Topologies
inferred← citeshttps://doi.org/10.1109/vppc.2008.4677753openalex-snapshot
Aerospace energy conservation utilizing optimum methods
inferred← citeshttps://doi.org/10.1243/09544100jaero191openalex-snapshot
A node-to-node composite graph and pseudo-Boolean modelling: An unmanned aerial vehicle energy application
inferred← citeshttps://doi.org/10.1287/opre.48.1.129.12455openalex-snapshot
A Tabu Search Heuristic for the Capacitated arc Routing Problem
inferred← citeshttps://doi.org/10.15517/rmta.v19i2.1334openalex-snapshot
Variants of the mixed postman problem solvable using linear programming
inferred← citeshttps://doi.org/10.2139/ssrn.6839414openalex-snapshot
A 3-approximation algorithm for solving the constrained windy postman problem
inferred← citeshttps://doi.org/10.22034/2015.4.03openalex-snapshot
Capacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
inferred← citeshttps://doi.org/10.33915/etd.7707openalex-snapshot
Environment Search Planning Subject to High Robot Localization Uncertainty
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.701-702.44openalex-snapshot
Genetic Algorithm for the Capacitated Chinese Postman Problem on Mixed Networks
inferred← citeshttps://doi.org/10.46298/dmtcs.3396openalex-snapshot
The Windy Postman Problem on Series-Parallel Graphs
inferred← citeshttps://doi.org/10.70675/24b9d2d5za989z479fz9948zc75078079910openalex-snapshot
Optimisation des tournées d'inspection des voies ferroviaires
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.