Reoptimizing the traveling salesman problem
From MaRDI portal
Publication:4432763
DOI10.1002/net.10091zbMath1053.90126OpenAlexW2170929650MaRDI QIDQ4432763
No author found.
Publication date: 29 October 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10091
Related Items
Reoptimization of Steiner trees: changing the terminal set ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Reoptimization of parameterized problems ⋮ Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ Reoptimizing the 0-1 knapsack problem ⋮ Reoptimization of maximum weight induced hereditary subgraph problems ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Recent challenges in Routing and Inventory Routing: E‐commerce and last‐mile delivery ⋮ Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses ⋮ Steiner tree reoptimization in graphs with sharpened triangle inequality ⋮ Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem ⋮ Reoptimization of NP-Hard Problems ⋮ Unnamed Item ⋮ Reoptimization of the shortest common superstring problem ⋮ A theory and algorithms for combinatorial reoptimization ⋮ On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems ⋮ Reoptimization of max \(k\)-cover: approximation ratio threshold ⋮ On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ Knowing All Optimal Solutions Does Not Help for TSP Reoptimization ⋮ Reoptimization of set covering problems ⋮ On one approach to TSP structural stability ⋮ Reoptimization of the metric deadline TSP ⋮ Reoptimization of the Metric Deadline TSP ⋮ Fast reoptimization for the minimum spanning tree problem ⋮ Reoptimization of Weighted Graph and Covering Problems ⋮ On the Hardness of Reoptimization ⋮ Structural Properties of Hard Metric TSP Inputs ⋮ Reallocation problems in scheduling ⋮ Approximation hardness of deadline-TSP reoptimization ⋮ Reoptimization of the Shortest Common Superstring Problem ⋮ Finding Optimal Solutions With Neighborly Help. ⋮ Reoptimization of minimum and maximum traveling salesman's tours ⋮ REOPTIMIZATION UNDER VERTEX INSERTION: MAX Pk-FREE SUBGRAPH AND MAX PLANAR SUBGRAPH ⋮ Introduction to reconfiguration
Cites Work
