On the public citation graph

The Koopmans-Beckman Quadratic Assignment Problem with Toepliz and Monge Monotone matrices

0 signed · 5 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01585868openalex-snapshot
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
inferredcites →https://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferredcites →https://doi.org/10.1112/plms/s2-25.1.265openalex-snapshot
The Maximum of a Certain Bilinear Form
inferredcites →https://doi.org/10.2307/1907742openalex-snapshot
Assignment Problems and the Location of Economic Activities
inferredcites →https://doi.org/10.2307/1970124openalex-snapshot
Extreme Hamiltonian Lines
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.