On the public citation graph
Extreme Hamiltonian Lines
0 signed · 58 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/978-1-4612-2972-8_2openalex-snapshot
Differentiable Functions and Singularities
inferredcites →https://doi.org/10.1007/978-3-540-68279-0_1openalex-snapshot
Solution of a Large-Scale Traveling-Salesman Problem
inferredcites →https://doi.org/10.1090/s0002-9939-1951-0045403-1openalex-snapshot
On the Shortest Path Through a Number of Points
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0083457-1openalex-snapshot
Some Combinatorial Extremum 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/3-540-61310-2_16openalex-snapshot
The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases
inferred← citeshttps://doi.org/10.1007/978-1-4614-0821-5_8openalex-snapshot
Interconnect Optimization by Net Ordering
inferred← citeshttps://doi.org/10.1007/978-3-319-07890-8_11openalex-snapshot
Another Look at the Shoelace TSP: The Case of Very Old Shoes
inferred← citeshttps://doi.org/10.1007/978-3-642-48417-9_41openalex-snapshot
Universal Conditions for Algebraic Traveling Salesman Problems to be Efficiently Solvable
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/bf01415751openalex-snapshot
The cone of Monge matrices: Extremal rays and applications
inferred← citeshttps://doi.org/10.1007/bf01585868openalex-snapshot
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
inferred← citeshttps://doi.org/10.1007/bf02019153openalex-snapshot
Special cases of travelling salesman problems and heuristics
inferred← citeshttps://doi.org/10.1007/bf02276883openalex-snapshot
A general approach to avoiding two by two submatrices
inferred← citeshttps://doi.org/10.1007/bf02684360openalex-snapshot
Spanning trees and shortest paths in monge graphs
inferred← citeshttps://doi.org/10.1007/bf03036463openalex-snapshot
On the recognition of permuted Supnick and incomplete Monge matrices
inferred← citeshttps://doi.org/10.1007/s10107-008-0231-zopenalex-snapshot
Optimal wire ordering and spacing in low power semiconductor design
inferred← citeshttps://doi.org/10.1007/s10479-017-2513-4openalex-snapshot
The multi-stripe travelling salesman problem
inferred← citeshttps://doi.org/10.1007/s10559-009-9088-2openalex-snapshot
Subclasses of solvable problems from classes of combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90024-qopenalex-snapshot
Efficiently solvable special cases of bottleneck travelling salesman problems
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00103-xopenalex-snapshot
Perspectives of Monge properties in optimization
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90037-xopenalex-snapshot
Monge matrices make maximization manageable
inferred← citeshttps://doi.org/10.1016/j.dam.2003.08.005openalex-snapshot
Traveling salesman games with the Monge property
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.017openalex-snapshot
Using well-solvable quadratic assignment problems for VLSI interconnect applications
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.ejor.2005.04.050openalex-snapshot
Monge properties, discrete convexity and applications
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.orl.2012.06.005openalex-snapshot
Another well-solvable case of the QAP: Maximizing the job completion time variance
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.1016/s0166-218x(99)00148-1openalex-snapshot
The Maximum Travelling Salesman Problem on symmetric Demidenko 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.1016/s0167-6377(02)00105-0openalex-snapshot
A remark about “A comment on consecutive-2-out-of-n systems”
inferred← citeshttps://doi.org/10.1023/a:1018939709890openalex-snapshot
New classes of efficiently solvable generalized Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1023/b:casa.0000047875.57623.23openalex-snapshot
Conic Characterization of Monge Matrices
inferred← citeshttps://doi.org/10.1051/ro/1997310403431openalex-snapshot
Three easy special cases of the euclidean travelling salesman problem
inferred← citeshttps://doi.org/10.1080/02331939108843720openalex-snapshot
Universal conditions for algebraic travelling salesman problems to be efficiently solvable
inferred← citeshttps://doi.org/10.1080/02331939708844313openalex-snapshot
A Note On Kalmanson Matrices∗
inferred← citeshttps://doi.org/10.1090/s0002-9904-1966-11421-0openalex-snapshot
Extrema concerning polygons in space-time
inferred← citeshttps://doi.org/10.1090/s0002-9939-1964-0163216-6openalex-snapshot
Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case
inferred← citeshttps://doi.org/10.1090/s0002-9939-1965-0185508-8openalex-snapshot
Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case
inferred← citeshttps://doi.org/10.1109/access.2020.3001278openalex-snapshot
Stability Analysis for the Modification Method Under the a Priori Strategy of the PTSP
inferred← citeshttps://doi.org/10.1109/isit.2005.1523354openalex-snapshot
Index assignment for scalar quantization with M-ary phase shift keying
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1970.tb45137.xopenalex-snapshot
Classes of Combinatorial Extrema
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1970.tb45156.xopenalex-snapshot
A CLASS OF COMBINATORIAL EXTREMA
inferred← citeshttps://doi.org/10.1137/s0036144596297514openalex-snapshot
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
inferred← citeshttps://doi.org/10.1137/s0895480190191619openalex-snapshot
A New Class of Pyramidally Solvable Symmetric Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1142/s0219198901000415openalex-snapshot
GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY
inferred← citeshttps://doi.org/10.15407/kvt207.01.005openalex-snapshot
Finding Subclasses of Solvable Problems in Combinary Optimization and Artificial Intelligence by Structure of Input In-formation
inferred← citeshttps://doi.org/10.15807/jorsj.45.36openalex-snapshot
OPTIMUM REQUIREMENT HAMILTON CYCLE PROBLEM WITH A MONGE-LIKE PROPERTY
inferred← citeshttps://doi.org/10.2139/ssrn.5480219openalex-snapshot
The Koopmans-Beckman Quadratic Assignment Problem with Toepliz and Monge Monotone matrices
inferred← citeshttps://doi.org/10.26552/com.c.2000.4.29-34openalex-snapshot
The Pyramidal Method for Traveling Salesman Problem
inferred← citeshttps://doi.org/10.4153/cjm-1974-076-xopenalex-snapshot
Extrema of a Class of Functions on a Finite Set
inferred← citeshttps://doi.org/10.5555/1109557.1109617openalex-snapshot
Four point conditions and exponential neighborhoods for symmetric TSP
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.