On the public citation graph
Efficiently solvable special cases of hard combinatorial optimization problems
0 signed · 41 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.1007/3-540-60313-1_139openalex-snapshot
Sometimes travelling is easy: The master tour problem
inferredcites →https://doi.org/10.1007/3-540-61310-2_36openalex-snapshot
The travelling salesman and the PQ-tree
inferredcites →https://doi.org/10.1007/3-540-61680-2_77openalex-snapshot
The structure of circular decomposable metrics
inferredcites →https://doi.org/10.1007/978-3-642-48417-9_41openalex-snapshot
Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable
inferredcites →https://doi.org/10.1007/978-3-642-61649-5_4openalex-snapshot
Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf01919179openalex-snapshot
Quadratic assignment problems on series-parallel digraphs
inferredcites →https://doi.org/10.1007/bf02061658openalex-snapshot
A primer of the Euclidean Steiner problem
inferredcites →https://doi.org/10.1007/bf02187871openalex-snapshot
Steiner minimal trees for regular polygons
inferredcites →https://doi.org/10.1007/bf02253612openalex-snapshot
Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood
inferredcites →https://doi.org/10.1007/bf02591867openalex-snapshot
Halin graphs and the travelling salesman problem
inferredcites →https://doi.org/10.1007/bf03036463openalex-snapshot
On the recognition of permuted Supnick and incomplete Monge matrices
inferredcites →https://doi.org/10.1016/0012-365x(95)00275-2openalex-snapshot
Cut and patch Steiner trees for ladders
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(87)90031-xopenalex-snapshot
Steiner problem in Halin networks
inferredcites →https://doi.org/10.1016/0166-218x(92)00189-sopenalex-snapshot
Recognition of d-dimensional Monge arrays
inferredcites →https://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferredcites →https://doi.org/10.1016/0196-6774(90)90031-9openalex-snapshot
Sequence comparison with mixed convex and concave costs
inferredcites →https://doi.org/10.1016/0377-2217(91)90179-yopenalex-snapshot
Discrete location theory
inferredcites →https://doi.org/10.1016/s0022-0000(76)80045-1openalex-snapshot
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(08)70332-7openalex-snapshot
Steiner Trees for Ladders
inferredcites →https://doi.org/10.1023/a:1009768317347openalex-snapshot
The Travelling Salesman Problem on Permuted Monge Matrices
inferredcites →https://doi.org/10.1057/jors.1995.61openalex-snapshot
A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas
inferredcites →https://doi.org/10.1080/0025570x.1989.11977416openalex-snapshot
Steiner Trees on a Checkerboard
inferredcites →https://doi.org/10.1080/02331939108843720openalex-snapshot
Universal conditions for algebraic travelling salesman problems to be efficiently solvable
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1214/aos/1176348536openalex-snapshot
Permutational Extreme Values of Autocorrelation Coefficients and a Pitman Test Against Serial Dependence
inferredcites →https://doi.org/10.1287/opre.12.5.655openalex-snapshot
Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.35.5.772openalex-snapshot
The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
inferredcites →https://doi.org/10.4153/cjm-1975-104-6openalex-snapshot
Edgeconvex Circuits and the Traveling Salesman Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-06901-7_24openalex-snapshot
The Two-Stripe Symmetric Circulant TSP is in P
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_2openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/s10107-025-02215-2openalex-snapshot
The two-stripe symmetric circulant TSP is in P
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.013openalex-snapshot
Circulant TSP: Vertices of the edge-length polytope and superpolynomial lower bounds
inferred← citeshttps://doi.org/10.1016/j.orl.2014.05.010openalex-snapshot
Using well-solvable minimum cost exact covering for VLSI clock energy minimization
inferred← citeshttps://doi.org/10.1016/j.orl.2024.107133openalex-snapshot
Circulant TSP special cases: Easily-solvable cases and improved approximations
inferred← citeshttps://doi.org/10.1063/1.3183570openalex-snapshot
Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube
inferred← citeshttps://doi.org/10.1109/tevc.2009.2028330openalex-snapshot
Nonlinear Network Optimization—An Embedding Vector Space Approach
inferred← citeshttps://doi.org/10.1137/19m1245840openalex-snapshot
Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
inferred← citeshttps://doi.org/10.2298/yjor0501005bopenalex-snapshot
Applications of a special polynomial class of TSP
inferred← citeshttps://doi.org/10.3390/architecture5030079openalex-snapshot
Building Geometry Generation Example Applying GPT Models
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.