On the public citation graph
Applications of Combinatorial Programming to Data Analysis: The Traveling Salesman and Related Problems
0 signed · 93 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/bs.3830180507openalex-snapshot
Ordinal scaling of multicategory persisting and disappearing traits
inferredcites →https://doi.org/10.1002/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
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.1007/978-3-642-51565-1_136openalex-snapshot
The Traveling Salesman Problem: A Survey
inferredcites →https://doi.org/10.1007/978-94-011-7557-9_7openalex-snapshot
Hamiltonian Circuits and the Travelling Salesman Problem
inferredcites →https://doi.org/10.1007/bf00538862openalex-snapshot
Abundance matrices and seriation in archaeology
inferredcites →https://doi.org/10.1007/bf01584070openalex-snapshot
The traveling-salesman problem and minimum spanning trees: Part II
inferredcites →https://doi.org/10.1007/bf01585505openalex-snapshot
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
inferredcites →https://doi.org/10.1007/bf02289088openalex-snapshot
A Method of Scalogram Analysis Using Summary Statistics
inferredcites →https://doi.org/10.1007/bf02289760openalex-snapshot
A Statistical Test for the Significance of a Coefficient of Reproducibility
inferredcites →https://doi.org/10.1016/0022-2496(75)90028-0openalex-snapshot
An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling
inferredcites →https://doi.org/10.1016/0025-5564(69)90061-3openalex-snapshot
Low overhead sequencing algorithm
inferredcites →https://doi.org/10.1016/0031-3203(74)90020-xopenalex-snapshot
Experiments with some cluster analysis algorithms
inferredcites →https://doi.org/10.1016/0041-1647(75)90055-6openalex-snapshot
A rapid heuristic algorithm for the approximate solution of the traveling salesman problem
inferredcites →https://doi.org/10.1037/h0020070openalex-snapshot
On the detection of structure in attitudes and developmental processes.
inferredcites →https://doi.org/10.1037/h0037348openalex-snapshot
Problems of seriation using a subject by item response matrix.
inferredcites →https://doi.org/10.1057/jors.1968.102openalex-snapshot
A Boundary Method for Planar Travelling Salesman Problems
inferredcites →https://doi.org/10.1057/jors.1972.79openalex-snapshot
Algorithms for Large-scale Travelling Salesman Problems
inferredcites →https://doi.org/10.1057/jors.1975.151openalex-snapshot
Some Simple Applications of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1057/jors.1976.202openalex-snapshot
Graph Theory: An Algorithmic Approach
inferredcites →https://doi.org/10.1080/00207547408919540openalex-snapshot
Contribution to the solution of sequencing problems in process industry
inferredcites →https://doi.org/10.1080/03155986.1971.11731484openalex-snapshot
Single-Stage Linear Programming Zero-One Solutions to Some Travelling Salesman Type Problems*
inferredcites →https://doi.org/10.1080/03610927408827164openalex-snapshot
Rapid seriation methods for multivariate observations through similarities
inferredcites →https://doi.org/10.1093/comjnl/10.4.374openalex-snapshot
Spanning tree manipulation and the travelling salesman problem
inferredcites →https://doi.org/10.1093/imamat/3.4.362openalex-snapshot
A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems
inferredcites →https://doi.org/10.1109/swat.1974.4openalex-snapshot
Approximate algorithms for the traveling salesperson problem
inferredcites →https://doi.org/10.1109/tsmc.1975.5409163openalex-snapshot
A Clustering and Data-Reorganizing Algorithm
inferredcites →https://doi.org/10.1109/tsmc.1976.5408399openalex-snapshot
An Efficient Clustering Algorithm
inferredcites →https://doi.org/10.1111/j.2044-8317.1972.tb00491.xopenalex-snapshot
TWO ADDITIONS TO HIERARCHICAL CLUSTER ANALYSIS†
inferredcites →https://doi.org/10.1111/j.2044-8317.1974.tb00534.xopenalex-snapshot
SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
inferredcites →https://doi.org/10.1111/j.2044-8317.1976.tb00701.xopenalex-snapshot
SERIATION USING ASYMMETRIC PROXIMITY MEASURES
inferredcites →https://doi.org/10.1111/j.2044-8317.1976.tb00714.xopenalex-snapshot
QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
inferredcites →https://doi.org/10.1111/j.2517-6161.1955.tb00192.xopenalex-snapshot
A Contribution to the “Travelling-Salesman” Problem
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1137/0119070openalex-snapshot
The Shortest Hamiltonian Chain of a Graph
inferredcites →https://doi.org/10.1145/321043.321046openalex-snapshot
Integer Programming Formulation of Traveling Salesman Problems
inferredcites →https://doi.org/10.1145/321105.321111openalex-snapshot
Dynamic Programming Treatment of the Travelling Salesman Problem
inferredcites →https://doi.org/10.1145/800125.804052openalex-snapshot
Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient
inferredcites →https://doi.org/10.1145/800160.805133openalex-snapshot
A man-machine approach toward solving the traveling salesman problem
inferredcites →https://doi.org/10.1147/rd.134.0400openalex-snapshot
Heuristic Algorithm for the Traveling-salesman Problem
inferredcites →https://doi.org/10.1287/mnsc.10.2.225openalex-snapshot
A Heuristic Approach to Solving Travelling Salesman Problems
inferredcites →https://doi.org/10.1287/mnsc.11.8.b166openalex-snapshot
Three Heuristic Rules for Sequencing Jobs to a Single Production Facility
inferredcites →https://doi.org/10.1287/mnsc.13.3.269openalex-snapshot
An Engineering Approach to the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.10.5.647openalex-snapshot
On the Relation Between the Traveling-Salesman and the Longest-Path Problems
inferredcites →https://doi.org/10.1287/opre.11.6.972openalex-snapshot
An Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.12.2.361openalex-snapshot
Letter to the Editor—Some Observations on the Longest Path Problem
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.1287/opre.16.3.538openalex-snapshot
The Traveling Salesman Problem: A Survey
inferredcites →https://doi.org/10.1287/opre.17.3.543openalex-snapshot
Letter to the Editor—Some Comments on the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.1287/opre.18.6.1163openalex-snapshot
A Theorem on Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1287/opre.19.2.278openalex-snapshot
Pathology of Traveling-Salesman Subtour-Elimination Algorithms
inferredcites →https://doi.org/10.1287/opre.20.5.1044openalex-snapshot
Technical Note—Bounds for the Travelling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.20.5.993openalex-snapshot
Problem Decomposition and Data Reorganization by a Clustering Technique
inferredcites →https://doi.org/10.1287/opre.21.1.340openalex-snapshot
Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.22.2.413openalex-snapshot
Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.5.6.841openalex-snapshot
Letter to the Editor—Graphic Solution of the Traveling-Salesman Problem
inferredcites →https://doi.org/10.1287/opre.6.6.791openalex-snapshot
A Method for Solving Traveling-Salesman Problems
inferredcites →https://doi.org/10.1287/opre.7.1.58openalex-snapshot
On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
inferredcites →https://doi.org/10.2307/2344692openalex-snapshot
Mathematics in the Archaeological and Historical Sciences.
inferredcites →https://doi.org/10.2307/277714openalex-snapshot
Seriation Methods for Archaeological Materials
inferredcites →https://doi.org/10.4324/9781315128948-35openalex-snapshot
A Scale for Developmental Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_109openalex-snapshot
Dynamic Programming in Clustering
inferred← citeshttps://doi.org/10.1007/3-540-45535-3_32openalex-snapshot
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_145openalex-snapshot
Dynamic Programming in Clustering
inferred← citeshttps://doi.org/10.1007/978-3-030-61844-5_8openalex-snapshot
Traveling Salesman Problem in a Geographic Information Management System
inferred← citeshttps://doi.org/10.1007/978-3-319-00951-3_11openalex-snapshot
On the Nearest Neighbor Algorithms for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/bf02293782openalex-snapshot
Matching Models in the Analysis of Cross-Classifications
inferred← citeshttps://doi.org/10.1007/bf02293800openalex-snapshot
Matrix Reorganization and Dynamic Programming: Applications to Paired Comparisons and Unidimensional Seriation
inferred← citeshttps://doi.org/10.1007/bf02295729openalex-snapshot
An Interactive Multiobjective Programming Approach to Combinatorial Data Analysis
inferred← citeshttps://doi.org/10.1007/s11336-005-1378-7openalex-snapshot
M.J. Brusco and S. Stahl (2005). Branch-and-bound applications in combinatorial data analysis. New York: Springer. xii+221 pp. US$69.95. ISBN 0387250379.
inferred← citeshttps://doi.org/10.1007/s11336-007-9021-4openalex-snapshot
Optimal Partitioning of a Data Set Based on the p-Median Model
inferred← citeshttps://doi.org/10.1016/0378-8733(90)90001-popenalex-snapshot
Blockmodels from the bond energy approach
inferred← citeshttps://doi.org/10.1016/b978-0-12-566760-9.50010-5openalex-snapshot
The Analysis of Organization and Structure in Free Recall
inferred← citeshttps://doi.org/10.1016/j.asoc.2023.110219openalex-snapshot
Discrete komodo algorithm for traveling salesman problem
inferred← citeshttps://doi.org/10.1051/ro/1987210100651openalex-snapshot
Solving a family of permutation problems on 0-1 matrices
inferred← citeshttps://doi.org/10.1080/07408179508936716openalex-snapshot
Evaluation of search algorithms and clustering efficiency measures for machine-part matrix clustering
inferred← citeshttps://doi.org/10.1111/j.2044-8317.2011.02021.xopenalex-snapshot
A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
inferred← citeshttps://doi.org/10.1117/12.2639458openalex-snapshot
Parallelizing the all-nearest-neighbor algorithm for Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1146/annurev.ps.43.020192.001125openalex-snapshot
Combinatorial Data Analysis
inferred← citeshttps://doi.org/10.1186/1751-0473-1-3openalex-snapshot
A traveling salesman approach for predicting protein functions
inferred← citeshttps://doi.org/10.1515/9783486787320openalex-snapshot
Graphisch gestützte Datenanalyse
inferred← citeshttps://doi.org/10.18637/jss.v023.i02openalex-snapshot
TSP- Infrastructure for the Traveling Salesperson Problem
inferred← citeshttps://doi.org/10.3390/mca18030459openalex-snapshot
A Parametric Hybrid Method for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.9734/bjmcs/2015/14453openalex-snapshot
New Variable Neighborhood Search Structure for Travelling Salesman Problems
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.