On the public citation graph
Algorithm for the solution of the assignment problem for sparse matrices
0 signed · 22 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1007/978-3-642-51576-7openalex-snapshot
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
inferredcites →https://doi.org/10.1007/978-3-642-51576-7_1openalex-snapshot
The Linear Sum Assignment Problem
inferredcites →https://doi.org/10.1007/bf01584319openalex-snapshot
The alternating basis algorithm for assignment problems
inferredcites →https://doi.org/10.1145/355873.355883openalex-snapshot
Algorithm 548: Solution of the Assignment Problem [H]
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.3230200605openalex-snapshot
Time‐dependent traveling salesman problem–the deliveryman case
inferred← citeshttps://doi.org/10.1007/bf02240205openalex-snapshot
An efficient labeling technique for solving sparse assignment problems
inferred← citeshttps://doi.org/10.1007/bf02278710openalex-snapshot
A shortest augmenting path algorithm for dense and sparse linear assignment problems
inferred← citeshttps://doi.org/10.1007/bf02288323openalex-snapshot
Algorithms and codes for the assignment problem
inferred← citeshttps://doi.org/10.1007/bf02684443openalex-snapshot
Solution methods and computational investigations for the Linear Bottleneck Assignment Problem
inferred← citeshttps://doi.org/10.1007/bfb0043834openalex-snapshot
Assignment problems: Recent solution methods and applications
inferred← citeshttps://doi.org/10.1007/s10288-011-0193-5openalex-snapshot
Heuristic algorithms and learning techniques: applications to the graph coloring problem
inferred← citeshttps://doi.org/10.1016/0166-218x(87)90016-3openalex-snapshot
Primal-dual algrorithms for the assignment problem
inferred← citeshttps://doi.org/10.1016/0167-6377(86)90073-8openalex-snapshot
Improving the Hungarian assignment algorithm
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90218-3openalex-snapshot
An efficient algorithm for the bipartite matching problem
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73238-9openalex-snapshot
Linear Assignment Problems
inferred← citeshttps://doi.org/10.1109/cacsd.1994.288932openalex-snapshot
Computation of zeros: a decomposition algorithm for large scale systems
inferred← citeshttps://doi.org/10.1109/cvpr.2019.01112openalex-snapshot
CrowdPose: Efficient Crowded Scenes Pose Estimation and a New Benchmark
inferred← citeshttps://doi.org/10.1145/115234.115349openalex-snapshot
A parallel shortest augmenting path algorithm for the assignment problem
inferred← citeshttps://doi.org/10.1155/s1173912698000042openalex-snapshot
Managing cost uncertainties in transportation and assignment problems
inferred← citeshttps://doi.org/10.48550/arxiv.1905.05337openalex-snapshot
Scaling Bayesian Probabilistic Record Linkage with Post-Hoc Blocking: An Application to the California Great Registers
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.