On the public citation graph
Complexity of some inverse shortest path lengths problems
0 signed · 35 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.1006/jagm.1999.1052openalex-snapshot
A Faster Algorithm for the Inverse Spanning Tree Problem
inferredcites →https://doi.org/10.1007/3-540-46632-0_29openalex-snapshot
Reverse Center Location Problem
inferredcites →https://doi.org/10.1007/978-3-642-59179-2_8openalex-snapshot
The inverse shortest paths problem with upper bounds on shortest paths costs
inferredcites →https://doi.org/10.1007/bf01193863openalex-snapshot
Inverse Matroid Intersection Problem
inferredcites →https://doi.org/10.1007/bf01432364openalex-snapshot
A column generation method for inverse shortest path problems
inferredcites →https://doi.org/10.1007/bf01582056openalex-snapshot
On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
inferredcites →https://doi.org/10.1007/bf01585693openalex-snapshot
On an instance of the inverse shortest paths problem
inferredcites →https://doi.org/10.1007/s10107-004-0515-xopenalex-snapshot
The inverse optimal value problem
inferredcites →https://doi.org/10.1016/s0377-2217(02)00876-7openalex-snapshot
Inapproximability and a polynomially solvable special case of a network improvement problem
inferredcites →https://doi.org/10.1016/s0377-2217(99)00122-8openalex-snapshot
Some reverse location problems
inferredcites →https://doi.org/10.1023/a:1008360312607openalex-snapshot
The Complexity Analysis of the Inverse Center Location Problem
inferredcites →https://doi.org/10.1023/a:1013807829021openalex-snapshot
A General Model of Some Inverse Combinatorial Optimization Problems and Its Solution Method Under l ∞ Norm
inferredcites →https://doi.org/10.1023/a:1027305419461openalex-snapshot
On Inverse Problems of Optimum Perfect Matching
inferredcites →https://doi.org/10.1023/b:coap.0000013061.17529.79openalex-snapshot
A Network Improvement Problem Under Different Norms
inferredcites →https://doi.org/10.1023/b:joco.0000038914.26975.9bopenalex-snapshot
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/1.9781611970791openalex-snapshot
Interior-Point Polynomial Algorithms in Convex Programming
inferredcites →https://doi.org/10.1287/moor.18.1.116openalex-snapshot
A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
inferredcites →https://doi.org/10.1287/opre.47.2.291openalex-snapshot
Solving Inverse Spanning Tree Problems Through Network Flow Techniques
inferredcites →https://doi.org/10.1287/opre.51.5.785.16756openalex-snapshot
Efficient Algorithms for the Inverse Spanning-Tree Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00186-026-00924-8openalex-snapshot
A combinatorial algorithm for inverse continuous quadratic knapsack problem
inferred← citeshttps://doi.org/10.1007/s10898-022-01256-7openalex-snapshot
The restricted inverse optimal value problem on shortest path under $$l_1$$ norm on trees
inferred← citeshttps://doi.org/10.1016/j.cam.2022.114754openalex-snapshot
Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l∞ norm
inferred← citeshttps://doi.org/10.1016/j.comgeo.2023.102053openalex-snapshot
On reverse shortest paths in geometric proximity graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2013.08.002openalex-snapshot
Searching for realizations of finite metric spaces in tight spans
inferred← citeshttps://doi.org/10.1051/ro/2017088openalex-snapshot
Reverse maximum flow problem under the weighted Chebyshev distance
inferred← citeshttps://doi.org/10.1080/23249935.2026.2635567openalex-snapshot
Unveiling implicit path outlier deviations via foundational linear inverse optimization in mobility networks
inferred← citeshttps://doi.org/10.11361/journalcpij.57.995openalex-snapshot
A Method Using Inverse Shortest Paths Problem to Estimate Stopover Tourist Destinations Based on Heterogeneity
inferred← citeshttps://doi.org/10.17760/d20581983openalex-snapshot
Vulnerability and robustness in artificial intelligence for complex networks
inferred← citeshttps://doi.org/10.2208/jscejj.22-00347openalex-snapshot
A METHOD FOR VALUING FACILITIES AND CLASSIFYING VISITORS BASED ON TRAVEL COSTS
inferred← citeshttps://doi.org/10.2298/yjor150624009topenalex-snapshot
Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
inferred← citeshttps://doi.org/10.4018/ijncr.2014100103openalex-snapshot
A Genetic Algorithms Approach for Inverse Shortest Path Length 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.