On the public citation graph
The Traveling Salesman Problem with Many Visits to Few Cities
0 signed · 39 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/nav.3800030404openalex-snapshot
Variants of the hungarian method for assignment problems
inferredcites →https://doi.org/10.1016/0020-0190(81)90102-2openalex-snapshot
On minimal Eulerian graphs
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1137/0208045openalex-snapshot
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
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.28.6.1347openalex-snapshot
A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
inferredcites →https://doi.org/10.1287/opre.9.6.849openalex-snapshot
A Linear Programming Approach to the Cutting-Stock 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-030-86838-3_5openalex-snapshot
On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem
inferred← citeshttps://doi.org/10.1007/bf01581207openalex-snapshot
A polynomial algorithm for an integer quadratic non-separable transportation problem
inferred← citeshttps://doi.org/10.1007/bf01585874openalex-snapshot
Sequencing jobs that require common resources on a single machine: A solvable case of the TSP
inferred← citeshttps://doi.org/10.1007/s00453-011-9554-xopenalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/s10107-022-01882-9openalex-snapshot
High-multiplicity N-fold IP via configuration LP
inferred← citeshttps://doi.org/10.1007/s10878-005-1414-7openalex-snapshot
A Framework for the Complexity of High-Multiplicity Scheduling Problems
inferred← citeshttps://doi.org/10.1007/s11590-010-0205-yopenalex-snapshot
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
inferred← citeshttps://doi.org/10.1016/0305-0548(96)00016-0openalex-snapshot
Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100919openalex-snapshot
An invitation to “Fine-grained complexity of NP-complete problems”
inferred← citeshttps://doi.org/10.1016/j.disopt.2005.11.002openalex-snapshot
On the high multiplicity traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.07.038openalex-snapshot
High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106165openalex-snapshot
Waypoint routing on bounded treewidth graphs
inferred← citeshttps://doi.org/10.1016/j.omega.2022.102816openalex-snapshot
Approximations for many-visits multiple traveling salesman problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.027openalex-snapshot
The minimum backlog problem
inferred← citeshttps://doi.org/10.1023/a:1018942709213openalex-snapshot
No-wait flow shop scheduling with large lot sizes
inferred← citeshttps://doi.org/10.1057/s41274-017-0261-0openalex-snapshot
Single-commodity flow-based formulations and accelerated benders algorithms for the high-multiplicity asymmetric traveling salesman problem and its extensions
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892071openalex-snapshot
Approximability and in-approximability results for no-wait shop scheduling
inferred← citeshttps://doi.org/10.1111/j.1467-9574.2007.00362.xopenalex-snapshot
Multiplicity and complexity issues in contemporary production scheduling
inferred← citeshttps://doi.org/10.1137/1.9781611974782.10openalex-snapshot
Maximum Scatter TSP in Doubling Metrics
inferred← citeshttps://doi.org/10.1137/22m1483414openalex-snapshot
A 3/2-Approximation for the Metric Many-Visits Path TSP
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/s0895480100370803openalex-snapshot
Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme
inferred← citeshttps://doi.org/10.1145/3382038openalex-snapshot
Time- and Space-optimal Algorithm for the Many-visits TSP
inferred← citeshttps://doi.org/10.1287/opre.39.4.648openalex-snapshot
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
inferred← citeshttps://doi.org/10.15480/882.4143openalex-snapshot
Degree-Bounded Generalized Polymatroids and Approximating the Metric Many-Visits TSP
inferred← citeshttps://doi.org/10.26481/dis.20031120agopenalex-snapshot
High multiplicity scheduling problems
inferred← citeshttps://doi.org/10.26481/umamet.2001006openalex-snapshot
Throughput Rate Optimization in High Multiplicity Sequencing Problems
inferred← citeshttps://doi.org/10.55630/sjc.2022.16.57-70openalex-snapshot
Walk on the Hypercube with Minimum Similarities
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.