On the public citation graph
On the recognition of permuted Supnick and incomplete Monge matrices
0 signed · 21 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.1007/bf02019153openalex-snapshot
Special cases of travelling salesman problems and heuristics
inferredcites →https://doi.org/10.1007/bf02276883openalex-snapshot
A general approach to avoiding two by two submatrices
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.1016/0166-218x(94)00019-aopenalex-snapshot
On the recognition of permuted bottleneck Monge matrices
inferredcites →https://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferredcites →https://doi.org/10.4064/am-19-3-4-531-539openalex-snapshot
On a class of polynomially solvable travelling salesman problems
inferredcites →https://doi.org/10.5555/320176.320221openalex-snapshot
Characterization and algorithms for greedily solvable transportation 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/bf02614311openalex-snapshot
Efficiently solvable special cases of hard combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s10951-016-0490-0openalex-snapshot
Open Shop Scheduling with Synchronization
inferred← citeshttps://doi.org/10.1016/j.dam.2016.04.019openalex-snapshot
The assignment problem with nearly Monge arrays and incompatible partner indices
inferred← citeshttps://doi.org/10.1016/j.disopt.2014.09.003openalex-snapshot
Four-point conditions for the TSP: The complete complexity classification
inferred← citeshttps://doi.org/10.1016/j.orl.2023.07.008openalex-snapshot
Recognising permuted Demidenko matrices
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00119-7openalex-snapshot
On the traveling salesman problem with a relaxed Monge matrix
inferred← citeshttps://doi.org/10.1023/b:casa.0000047875.57623.23openalex-snapshot
Conic Characterization of Monge 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.15807/jorsj.43.417openalex-snapshot
A GENERALIZED OPTIMUM REQUIREMENT SPANNING TREE PROBLEM WITH A MONGE-LIKE PROPERTY
inferred← citeshttps://doi.org/10.21136/am.2020.0370-19openalex-snapshot
Interval matrices with Monge property
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.