On the public citation graph
An in-core/out-of-core method for solving large scale assignment problems
0 signed · 16 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/978-3-642-51576-7openalex-snapshot
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
inferredcites →https://doi.org/10.1007/bf01584237openalex-snapshot
A new algorithm for the assignment problem
inferredcites →https://doi.org/10.1007/bf01593789openalex-snapshot
The zero pivot phenomenon in transportation and assignment problems and its computational implications
inferredcites →https://doi.org/10.1007/bf02022037openalex-snapshot
The shortest augmenting path method for solving assignment problems — Motivation and computational experience
inferredcites →https://doi.org/10.1007/bf02240205openalex-snapshot
An efficient labeling technique for solving sparse assignment problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_3openalex-snapshot
Matching: Arc Routing and the Solution Connection
inferred← citeshttps://doi.org/10.1007/bf01594929openalex-snapshot
Solving (large scale) matching problems combinatorially
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/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.1016/0305-0548(96)00010-xopenalex-snapshot
Linear and semi-assignment problems: A core oriented approach
inferred← citeshttps://doi.org/10.1016/0377-0427(88)90001-5openalex-snapshot
On the Euclidean assignment problem
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00361-0openalex-snapshot
Linear assignment procedures
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2906230openalex-snapshot
Efficient Resource Allocation for IoT Cellular Networks in the Presence of Inter-Band Interference
inferred← citeshttps://doi.org/10.1155/s1173912698000042openalex-snapshot
Managing cost uncertainties in transportation and assignment problems
inferred← citeshttps://doi.org/10.3390/rs17122039openalex-snapshot
Large Quantities of Acoustic Multibeam Bathymetric Point Clouds: Organizing Method for Efficient Storage and Retrieval
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.