On the public citation graph
Solving (large scale) matching problems combinatorially
0 signed · 51 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.3230160102openalex-snapshot
Solving large‐scale matching problems efficiently: A new primal matching approach
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/bf01584376openalex-snapshot
Solving matching problems with linear programming
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/bf01919285openalex-snapshot
An in-core/out-of-core method for solving large scale assignment problems
inferredcites →https://doi.org/10.1007/bf02240072openalex-snapshot
On the use of optimal fractional matchings for solving the (integer) matching problem
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices
inferredcites →https://doi.org/10.7551/mitpress/9997.003.0015openalex-snapshot
The Methods of Operations Research
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0142openalex-snapshot
C hinese Postman Problem
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/978-1-4615-4495-1_3openalex-snapshot
Matching: Arc Routing and the Solution Connection
inferred← citeshttps://doi.org/10.1007/978-3-540-74029-2_4openalex-snapshot
Domain Walls, Droplets and Barriers in Two-Dimensional Ising Spin Glasses
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_103openalex-snapshot
Über die Matching Relaxation für das Set Partitioning Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-46955-8_10openalex-snapshot
Groundstates in Ising Spin Lattices by Optimal Matchings
inferred← citeshttps://doi.org/10.1007/bf01049016openalex-snapshot
On the ground-state threshold in random two-dimensional Ising �J models
inferred← citeshttps://doi.org/10.1007/bf01432809openalex-snapshot
Provably good solutions for the traveling salesman problem
inferred← citeshttps://doi.org/10.1007/s00453-014-9945-xopenalex-snapshot
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem
inferred← citeshttps://doi.org/10.1007/s00521-023-09195-4openalex-snapshot
Ant colony optimization for Chinese postman problem
inferred← citeshttps://doi.org/10.1007/s00521-024-10052-1openalex-snapshot
Ant Colony Optimization for solving Directed Chinese Postman Problem
inferred← citeshttps://doi.org/10.1007/s10955-011-0272-1openalex-snapshot
Ground States of Two-Dimensional Ising Spin Glasses: Fast Algorithms, Recent Developments and a Ferromagnet-Spin Glass Mixture
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/0378-4371(94)90166-xopenalex-snapshot
Groundstate threshold pc in Ising frustration systems on 2D regular lattices
inferred← citeshttps://doi.org/10.1016/0378-4371(95)00065-fopenalex-snapshot
Groundstate threshold in disordered anisotropic +/−J Ising models
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00484-8openalex-snapshot
A genetic-based framework for solving (multi-criteria) weighted matching problems
inferred← citeshttps://doi.org/10.1016/s0378-4371(97)00312-9openalex-snapshot
Groundstate threshold in triangular anisotropic +/−J Ising models
inferred← citeshttps://doi.org/10.1016/s0378-4371(97)00658-4openalex-snapshot
On minimal/maximal ground-state thresholds in uniform classes of 2D ±J Ising models
inferred← citeshttps://doi.org/10.1016/s0378-4371(99)00384-2openalex-snapshot
Effect on the groundstate threshold pc by different boundary conditions in 2D ±J Ising models
inferred← citeshttps://doi.org/10.1057/palgrave.jors.2600910openalex-snapshot
A Matching Approach for Replenishing Rectangular Stock Sizes
inferred← citeshttps://doi.org/10.1103/physrevb.64.180404openalex-snapshot
Lower critical dimension of Ising spin glasses
inferred← citeshttps://doi.org/10.1103/physrevb.66.224401openalex-snapshot
Stiffness exponent of two-dimensional Ising spin glasses for nonperiodic boundary conditions using aspect-ratio scaling
inferred← citeshttps://doi.org/10.1103/physrevb.67.214404openalex-snapshot
No spin-glass transition in the mobile-bond model
inferred← citeshttps://doi.org/10.1103/physrevb.69.104409openalex-snapshot
Generating droplets in two-dimensional Ising spin glasses using matching algorithms
inferred← citeshttps://doi.org/10.1103/physrevb.70.054429openalex-snapshot
Energy size effects of two-dimensional Ising spin glasses
inferred← citeshttps://doi.org/10.1103/physrevb.70.134425openalex-snapshot
Domain-wall energies and magnetization of the two-dimensional random-bond Ising model
inferred← citeshttps://doi.org/10.1103/physrevb.72.014429openalex-snapshot
Reduction of two-dimensional dilute Ising spin glasses
inferred← citeshttps://doi.org/10.1103/physrevb.72.104422openalex-snapshot
Exact algorithm for spin-correlation functions of the two-dimensional ±J Ising spin glass in the ground state
inferred← citeshttps://doi.org/10.1103/physrevb.73.184405openalex-snapshot
Determining energy barriers by iterated optimization: The two-dimensional Ising spin glass
inferred← citeshttps://doi.org/10.1103/physrevb.75.174415openalex-snapshot
Ground-state and domain-wall energies in the spin-glass region of the two-dimensional ±J random-bond Ising model
inferred← citeshttps://doi.org/10.1103/physrevb.77.144418openalex-snapshot
Droplets in the two-dimensional ±J Ising spin glass
inferred← citeshttps://doi.org/10.1142/s0129183199000504openalex-snapshot
GROUND STATES FOR LARGE SAMPLES OF TWO-DIMENSIONAL ISING SPIN GLASSES
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.1177/014662169201600408openalex-snapshot
Polynomial Algorithms for Item Matching
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.138openalex-snapshot
Computing Minimum-Weight Perfect Matchings
inferred← citeshttps://doi.org/10.1590/s0103-65132006000300014openalex-snapshot
Problema do carteiro chinês: escolha de métodos de solução e análise de tempos computacionais
inferred← citeshttps://doi.org/10.33915/etd.312openalex-snapshot
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
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.