On the public citation graph
New Formulations for the Scheduled Service Network Design Problem
0 signed · 3 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4620781openalex-extracted
Robust Service Network Design under Travel Time Uncertainty: Formulations and Exact Solutions
inferred← citeshttps://doi.org/10.1007/978-3-031-47686-0_24openalex-snapshot
A Continuous Time Physical Graph Based Formulation to Scheduled Service Network Design
inferred← citeshttps://doi.org/10.3390/pr10071373openalex-snapshot
An Iterative Backbone Algorithm for Service Network Design Problems
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.