On the public citation graph
Reoptimizing the traveling salesman problem
0 signed · 78 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-4020-9688-4_3openalex-snapshot
An analysis of several heuristics for the traveling salesman problem
inferredcites →https://doi.org/10.1007/s004530010071openalex-snapshot
Algorithms for the On-Line Travelling Salesman1
inferredcites →https://doi.org/10.1016/s0166-218x(96)00042-xopenalex-snapshot
Scheduling with forbidden sets
inferredcites →https://doi.org/10.1137/0206041openalex-snapshot
An Analysis of Several Heuristics for 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.1002/net.21995openalex-snapshot
Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery
inferred← citeshttps://doi.org/10.1002/net.22217openalex-snapshot
Heuristic reoptimization of time‐extended multi‐robot task allocation problems
inferred← citeshttps://doi.org/10.1002/wics.204openalex-snapshot
Reoptimization of the minimum spanning tree
inferred← citeshttps://doi.org/10.1007/11785293_20openalex-snapshot
Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
inferred← citeshttps://doi.org/10.1007/978-3-319-21365-1_40openalex-snapshot
On the Limits of Recursively Self-Improving AGI
inferred← citeshttps://doi.org/10.1007/978-3-319-62389-4_14openalex-snapshot
Reoptimization of Minimum Latency Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_10openalex-snapshot
Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_28openalex-snapshot
Reoptimization of NP-Hard Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_5openalex-snapshot
On the Hardness of Reoptimization
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_12openalex-snapshot
Reoptimization of the Metric Deadline TSP
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_16openalex-snapshot
Reoptimization of Weighted Graph and Covering Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-02441-2_8openalex-snapshot
Reoptimization of the Shortest Common Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_17openalex-snapshot
The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
inferred← citeshttps://doi.org/10.1007/978-3-642-18381-2_33openalex-snapshot
Structural Properties of Hard Metric TSP Inputs
inferred← citeshttps://doi.org/10.1007/978-3-642-20000-7_2openalex-snapshot
Knowing All Optimal Solutions Does Not Help for TSP Reoptimization
inferred← citeshttps://doi.org/10.1007/978-3-642-28076-4_10openalex-snapshot
Reoptimization of the Maximum Weighted P k -Free Subgraph Problem under Vertex Insertion
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_52openalex-snapshot
A Theory and Algorithms for Combinatorial Reoptimization
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_7openalex-snapshot
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_11openalex-snapshot
Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_19openalex-snapshot
New Advances in Reoptimizing the Minimum Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s00236-022-00428-yopenalex-snapshot
Reoptimization of parameterized problems
inferred← citeshttps://doi.org/10.1007/s00453-010-9419-8openalex-snapshot
Reoptimization of the Shortest Common Superstring Problem
inferred← citeshttps://doi.org/10.1007/s00453-014-9930-4openalex-snapshot
Reallocation Problems in Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-017-0274-8openalex-snapshot
A Theory and Algorithms for Combinatorial Reoptimization
inferred← citeshttps://doi.org/10.1007/s00453-020-00682-xopenalex-snapshot
Robust Reoptimization of Steiner Trees
inferred← citeshttps://doi.org/10.1007/s00453-023-01204-1openalex-snapshot
Finding Optimal Solutions with Neighborly Help
inferred← citeshttps://doi.org/10.1007/s00453-024-01243-2openalex-snapshot
New Algorithms for Steiner Tree Reoptimization
inferred← citeshttps://doi.org/10.1007/s10559-010-9269-zopenalex-snapshot
Reoptimization of set covering problems
inferred← citeshttps://doi.org/10.1007/s10559-011-9319-1openalex-snapshot
On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
inferred← citeshttps://doi.org/10.1007/s10559-012-9394-yopenalex-snapshot
Reoptimization of constraint satisfaction problems with approximation resistant predicates
inferred← citeshttps://doi.org/10.1007/s10559-012-9403-1openalex-snapshot
Reoptimization of max k-cover: approximation ratio threshold
inferred← citeshttps://doi.org/10.1007/s10559-012-9413-zopenalex-snapshot
On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field
inferred← citeshttps://doi.org/10.1007/s10878-018-0317-3openalex-snapshot
Reoptimization of minimum latency problem revisited: don’t panic when asked to revisit the route after local modifications
inferred← citeshttps://doi.org/10.1016/j.cor.2012.12.010openalex-snapshot
Reoptimizing the rural postman problem
inferred← citeshttps://doi.org/10.1016/j.dam.2010.08.003openalex-snapshot
Reoptimizing the 0–1 knapsack problem
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.015openalex-snapshot
Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.08.047openalex-snapshot
Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
inferred← citeshttps://doi.org/10.1016/j.ejtl.2021.100050openalex-snapshot
Modelling and comparison of stability metrics for a re-optimisation approach of the Inventory Routing Problem under demand uncertainty
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.11.003openalex-snapshot
A note on the traveling salesman reoptimization problem under vertex insertion
inferred← citeshttps://doi.org/10.1016/j.jda.2008.12.001openalex-snapshot
Reoptimization of minimum and maximum traveling salesman's tours
inferred← citeshttps://doi.org/10.1016/j.jda.2009.04.001openalex-snapshot
Reoptimization of the metric deadline TSP
inferred← citeshttps://doi.org/10.1016/j.jda.2009.07.002openalex-snapshot
Fast reoptimization for the minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.jda.2011.03.014openalex-snapshot
Steiner tree reoptimization in graphs with sharpened triangle inequality
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.04.039openalex-snapshot
Reoptimization of Steiner trees: Changing the terminal set
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.016openalex-snapshot
Approximation hardness of deadline-TSP reoptimization
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.037openalex-snapshot
Reoptimization of maximum weight induced hereditary subgraph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.04.004openalex-snapshot
Reoptimization in machine scheduling
inferred← citeshttps://doi.org/10.1016/j.trc.2024.104611openalex-snapshot
Dynamic vehicle routing problem with drone resupply for same-day delivery
inferred← citeshttps://doi.org/10.1051/ro/2011114openalex-snapshot
A survey on combinatorial optimization in dynamic environments
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00230openalex-snapshot
REDE: Exploring Relay Transportation for Efficient Last-mile Delivery
inferred← citeshttps://doi.org/10.1109/tcns.2018.2843164openalex-snapshot
Locality in Network Optimization
inferred← citeshttps://doi.org/10.1109/tmc.2026.3671756openalex-snapshot
Mobility-Aware Order Relay in Last-Mile Delivery
inferred← citeshttps://doi.org/10.1111/mice.12023openalex-snapshot
Activity‐Based Travel Scenario Analysis with Routing Problem Reoptimization
inferred← citeshttps://doi.org/10.1115/1.4036565openalex-snapshot
A Combinatorial Approach for Developing Ring Communication Graphs for Vehicle Formations
inferred← citeshttps://doi.org/10.1142/9781848162778_0004openalex-snapshot
Complexity and Approximation in Reoptimization
inferred← citeshttps://doi.org/10.1142/s1793830913600045openalex-snapshot
REOPTIMIZATION UNDER VERTEX INSERTION: MAX Pk-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH
inferred← citeshttps://doi.org/10.1145/2486159.2486181openalex-snapshot
Reallocation problems in scheduling
inferred← citeshttps://doi.org/10.1145/2594538.2594548openalex-snapshot
Cost-oblivious storage reallocation
inferred← citeshttps://doi.org/10.1145/2755573.2755589openalex-snapshot
Cost-Oblivious Reallocation for Scheduling and Planning
inferred← citeshttps://doi.org/10.1155/2014/397025openalex-snapshot
On One Approach to TSP Structural Stability
inferred← citeshttps://doi.org/10.2139/ssrn.5083035openalex-snapshot
The GOOGLE and XPRIZE award for how to use quantum computers practically: The problem of the "P" versus "NP" outputs of any quantum computer and the pathway for its resolving
inferred← citeshttps://doi.org/10.3233/fi-2011-528openalex-snapshot
On the Hardness of Reoptimization with Multiple Given Solutions
inferred← citeshttps://doi.org/10.3390/su141610190openalex-snapshot
The Multi-Depot Traveling Purchaser Problem with Shared Resources
inferred← citeshttps://doi.org/10.3929/ethz-a-007161496openalex-snapshot
Reoptimization of NP-hard Problems
inferred← citeshttps://doi.org/10.4236/ajor.2013.32025openalex-snapshot
Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1212.1735openalex-snapshot
Towards Design of System Hierarchy (research survey)
inferred← citeshttps://doi.org/10.48550/arxiv.1304.4965openalex-snapshot
Improvement/Extension of Modular Systems as Combinatorial Reengineering (Survey)
inferred← citeshttps://doi.org/10.48550/arxiv.1305.6555openalex-snapshot
Reallocation Problems in Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.1404.2019openalex-snapshot
Cost-oblivious storage reallocation
inferred← citeshttps://doi.org/10.48550/arxiv.1502.06512openalex-snapshot
From Seed AI to Technological Singularity via Recursively Self-Improving Software
inferred← citeshttps://doi.org/10.48550/arxiv.1512.06427openalex-snapshot
Towards Integrated Glance To Restructuring in Combinatorial Optimization
inferred← citeshttps://doi.org/10.70675/76841082z7c69z4306zbf24zef7b904bf22aopenalex-snapshot
Inventory Routing Problem : Managing demand and travelling time uncertainties
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.