On the public citation graph
On the use of optimal fractional matchings for solving the (integer) matching problem
0 signed · 37 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/net.3230110407openalex-snapshot
A shortest augmenting path method for solving minimal perfect matching problems
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/bf02022037openalex-snapshot
The shortest augmenting path method for solving assignment problems — Motivation and computational experience
inferredcites →https://doi.org/10.1287/mnsc.12.3.253openalex-snapshot
Integer Programming: Methods, Uses, Computations
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
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.3230190406openalex-snapshot
A new algorithm for general matching problems using network flow subproblems
inferred← citeshttps://doi.org/10.1002/net.3230200602openalex-snapshot
Matching problems with generalized upper bound side constraints
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_31openalex-snapshot
Testing the necklace condition for Shortest Tours and optimal factors in the plane
inferred← citeshttps://doi.org/10.1007/3-540-44691-5_3openalex-snapshot
Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_2openalex-snapshot
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
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/978-3-642-74862-2_51openalex-snapshot
Ein Verfahren zur Lösung großer Matching-Probleme
inferred← citeshttps://doi.org/10.1007/978-3-642-77489-8_11openalex-snapshot
On the Construction of the Set of K-best Matchings and Their Use in Solving Constrained Matching Problems
inferred← citeshttps://doi.org/10.1007/bf01580902openalex-snapshot
Solving combinatorial optimization problems using Karmarkar's algorithm
inferred← citeshttps://doi.org/10.1007/bf01594929openalex-snapshot
Solving (large scale) matching problems combinatorially
inferred← citeshttps://doi.org/10.1007/bf02288324openalex-snapshot
Solving non-bipartite matching problems via shortest path techniques
inferred← citeshttps://doi.org/10.1007/s12532-009-0002-8openalex-snapshot
Blossom V: a new implementation of a minimum cost perfect matching algorithm
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90078-7openalex-snapshot
An efficient matching algorithm applied in statistical physics
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90133-3openalex-snapshot
Testing the necklace condition for shortest tours and optimal factors in the plane
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.01.011openalex-snapshot
Laps Care—an operational system for staff planning of home care
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00225-1openalex-snapshot
Aircrew schedule generation using repeated matching
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00045-9openalex-snapshot
A repeated matching heuristic for the single-source capacitated facility location problem
inferred← citeshttps://doi.org/10.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1109/rait.2018.8389077openalex-snapshot
Content matching problem in large scale network using weighted b-matching algorithm
inferred← citeshttps://doi.org/10.1109/sc.2016.65openalex-snapshot
Designing Scalable b-MATCHING Algorithms on Distributed Memory Multiprocessors by Approximation
inferred← citeshttps://doi.org/10.1137/15m1026304openalex-snapshot
Efficient Approximation Algorithms for Weighted $b$-Matching
inferred← citeshttps://doi.org/10.1139/x07-065openalex-snapshot
Optimization based planning tools for routing of forwarders at harvest areas
inferred← citeshttps://doi.org/10.1145/347792.347815openalex-snapshot
Implementing weighted b-matching algorithms
inferred← citeshttps://doi.org/10.1145/351827.384250openalex-snapshot
Implementing weighted b-matching algorithms
inferred← citeshttps://doi.org/10.1145/944618.944622openalex-snapshot
Implementation of O ( nm log n ) weighted matchings in general graphs
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.138openalex-snapshot
Computing Minimum-Weight Perfect Matchings
inferred← citeshttps://doi.org/10.4018/978-1-5225-7335-7.ch017openalex-snapshot
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
inferred← citeshttps://doi.org/10.7148/2021-0016openalex-snapshot
Evaluation Of Algorithm Performance For Simulated Square And Non-Square Logistic Assignment 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.