On the public citation graph
Inverse Matroid Intersection Problem
0 signed · 36 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/bf01432364openalex-snapshot
A column generation method for inverse shortest path problems
inferredcites →https://doi.org/10.1007/bf01585693openalex-snapshot
On an instance of the inverse shortest paths problem
inferredcites →https://doi.org/10.1007/bf02579369openalex-snapshot
A strongly polynomial minimum cost circulation algorithm
inferredcites →https://doi.org/10.1007/bf03167381openalex-snapshot
An inverse problem of the weighted shortest path problem
inferredcites →https://doi.org/10.1016/0196-6774(81)90032-8openalex-snapshot
A weighted matroid intersection algorithm
inferredcites →https://doi.org/10.1016/s0166-218x(97)86750-9openalex-snapshot
A strongly polynomial algorithm for the inverse shortest arborescence problem
inferredcites →https://doi.org/10.1080/10556789708805666openalex-snapshot
An algorithm for inverse minimum spanning tree problem
inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
inferredcites →https://doi.org/10.21236/ada457044openalex-snapshot
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20163openalex-snapshot
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
inferred← citeshttps://doi.org/10.1002/net.20344openalex-snapshot
Complexity of some inverse shortest path lengths problems
inferred← citeshttps://doi.org/10.1006/jagm.1999.1052openalex-snapshot
A Faster Algorithm for the Inverse Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_29openalex-snapshot
Reverse Center Location Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/s11766-998-0028-0openalex-snapshot
Note on inverse problem with l ∞ objective function
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126328openalex-snapshot
The minmax regret inverse maximum weight problem
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.027openalex-snapshot
A simple algorithm and min–max formula for the inverse arborescence problem
inferred← citeshttps://doi.org/10.1016/j.dam.2022.12.004openalex-snapshot
Inverse optimization problems with multiple weight functions
inferred← citeshttps://doi.org/10.1016/j.jksus.2023.102825openalex-snapshot
A bibliometric analysis of inverse optimization
inferred← citeshttps://doi.org/10.1016/j.omega.2021.102562openalex-snapshot
The Weapon Target Assignment Problem: Rational Inference of Adversary Target Utility Valuations from Observed Solutions
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00498-5openalex-snapshot
The base-matroid and inverse combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s0377-0427(99)00080-1openalex-snapshot
A further study on inverse linear programming problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00122-8openalex-snapshot
Some reverse location problems
inferred← citeshttps://doi.org/10.1017/s0334270000010572openalex-snapshot
The inverse fractional matching problem
inferred← citeshttps://doi.org/10.1023/a:1004685508517openalex-snapshot
Inverse Problems of Submodular Functions on Digraphs
inferred← citeshttps://doi.org/10.1023/a:1008360312607openalex-snapshot
The Complexity Analysis of the Inverse Center Location Problem
inferred← citeshttps://doi.org/10.1023/a:1009829525096openalex-snapshot
Solution Structure of Some Inverse Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1023/a:1009877408258openalex-snapshot
Inverse Polymatroidal Flow Problem
inferred← citeshttps://doi.org/10.1023/a:1027305419461openalex-snapshot
On Inverse Problems of Optimum Perfect Matching
inferred← citeshttps://doi.org/10.1023/b:joco.0000038914.26975.9bopenalex-snapshot
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
inferred← citeshttps://doi.org/10.2298/yjor220516037nopenalex-snapshot
The inverse k-max combinatorial optimization problem
inferred← citeshttps://doi.org/10.35834/mjms/1559181623openalex-snapshot
Computation of Inverse 1-Center Location Problem on the Weighted Trapezoid Graphs
inferred← citeshttps://doi.org/10.4018/ijncr.2014100103openalex-snapshot
A Genetic Algorithms Approach for Inverse Shortest Path Length Problems
inferred← citeshttps://doi.org/10.4304/jnw.5.10.1169-1176openalex-snapshot
An Efficient Algorithm for Reverse 2-median Problem on A Cycle
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.