On the public citation graph
Mathematical Programming Approaches for Exact Solutionof the First-Mile Ride-Sharing 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.20331openalex-snapshot
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
inferredcites →https://doi.org/10.1007/pl00011432openalex-snapshot
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
inferredcites →https://doi.org/10.1007/s10107-005-0611-6openalex-snapshot
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
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.