On the public citation graph
The cone of Monge matrices: Extremal rays and applications
0 signed · 27 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/9781119584445.ch10openalex-snapshot
The Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1016/0020-0190(91)90118-2openalex-snapshot
A special case of the n-vertex traveling-salesman problem that can be solved in O(n) time
inferredcites →https://doi.org/10.1090/pspum/007/0157778openalex-snapshot
On simple linear programming problems
inferredcites →https://doi.org/10.4064/am-19-3-4-531-539openalex-snapshot
On a class of polynomially solvable travelling salesman problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4868473openalex-extracted
The Structure and Normalized Volume of Monge Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-642-50282-8_37openalex-snapshot
Computational Problems that can be Solved Without Computation
inferred← citeshttps://doi.org/10.1007/s00357-017-9230-1openalex-snapshot
Robinsonian Matrices: Recognition Challenges
inferred← citeshttps://doi.org/10.1007/s11590-020-01571-6openalex-snapshot
Equally weighted cardinality constrained portfolio selection via factor models
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2015.01.005openalex-snapshot
Well-solvable cases of the QAP with block-structured matrices
inferred← citeshttps://doi.org/10.1016/j.ejor.2017.12.024openalex-snapshot
New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.006openalex-snapshot
The complexity of approximating conservative counting CSPs
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.08.004openalex-snapshot
On totally positive matrices and geometric incidences
inferred← citeshttps://doi.org/10.1016/j.orl.2012.06.005openalex-snapshot
Another well-solvable case of the QAP: Maximizing the job completion time variance
inferred← citeshttps://doi.org/10.1016/s0024-3795(01)00283-xopenalex-snapshot
Equilibrated anti-Monge matrices
inferred← citeshttps://doi.org/10.1016/s0167-6377(01)00067-0openalex-snapshot
A comment on consecutive-2-out-of-n systems
inferred← citeshttps://doi.org/10.1023/b:casa.0000047875.57623.23openalex-snapshot
Conic Characterization of Monge Matrices
inferred← citeshttps://doi.org/10.1073/pnas.1505664112openalex-snapshot
A complexity classification of spin systems with an external field
inferred← citeshttps://doi.org/10.1080/02331939708844313openalex-snapshot
A Note On Kalmanson Matrices∗
inferred← citeshttps://doi.org/10.1137/s0036144596297514openalex-snapshot
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
inferred← citeshttps://doi.org/10.1613/jair.1400openalex-snapshot
A Maximal Tractable Class of Soft Constraints
inferred← citeshttps://doi.org/10.21136/am.2020.0370-19openalex-snapshot
Interval matrices with Monge property
inferred← citeshttps://doi.org/10.48550/arxiv.1309.4542openalex-snapshot
On Totally Positive Matrices and Geometric Incidences
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.