On the public citation graph

Polyhedral Analysis and a Preprocessed Labeling Algorithm for the Elementary Shortest Path Problem with Resource Constraints

https://doi.org/10.2139/ssrn.6595201
0 signed · 18 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/net.20033openalex-snapshot
An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
inferredcites →https://doi.org/10.1002/net.20178openalex-snapshot
Path inequalities for the vehicle routing problem with time windows
inferredcites →https://doi.org/10.1002/net.20212openalex-snapshot
New dynamic programming algorithms for the resource constrained elementary shortest path problem
inferredcites →https://doi.org/10.1002/net.21511openalex-snapshot
A survey of resource constrained shortest path problems: Exact solution approaches
inferredcites →https://doi.org/10.1002/net.21960openalex-snapshot
An exact bidirectional pulse algorithm for the constrained shortest path
inferredcites →https://doi.org/10.1002/net.3230040304openalex-snapshot
Shortest path with time constraints on movement and parking
inferredcites →https://doi.org/10.1007/0-387-25486-2_2openalex-snapshot
Shortest Path Problems with Resource Constraints
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/s00291-012-0302-7openalex-snapshot
Solving elementary shortest-path problems as mixed-integer programs
inferredcites →https://doi.org/10.1016/j.cor.2010.11.005openalex-snapshot
Solving a robust airline crew pairing problem with column generation
inferredcites →https://doi.org/10.1016/j.ejor.2016.01.003openalex-snapshot
Integer programming formulations for the elementary shortest path problem
inferredcites →https://doi.org/10.1016/j.ejor.2023.11.047openalex-snapshot
A multiphase dynamic programming algorithm for the shortest path problem with resource constraints
inferredcites →https://doi.org/10.1111/j.1475-3995.2008.00681.xopenalex-snapshot
A strong flow‐based formulation for the shortest path problem in digraphs with negative cycles
inferredcites →https://doi.org/10.1145/3381449openalex-snapshot
JGraphT—A Java Library for Graph Data Structures and Algorithms
inferredcites →https://doi.org/10.1287/opre.1110.0975openalex-snapshot
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
inferredcites →https://doi.org/10.1287/opre.40.2.342openalex-snapshot
A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1287/trsc.1090.0282openalex-snapshot
A New Approach for Air Cargo Network Planning
inferredcites →https://doi.org/10.1287/trsc.2014.0582openalex-snapshot
An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints
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.