Pages that link to "Item:Q5757891"
From MaRDI portal
The following pages link to Reoptimization of Minimum and Maximum Traveling Salesman’s Tours (Q5757891):
Displayed 27 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Reoptimization of set covering problems (Q2247803) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Reoptimization in machine scheduling (Q2453159) (← links)
- New Reoptimization Techniques applied to Steiner Tree Problem (Q2840741) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- Reoptimization of Weighted Graph and Covering Problems (Q3602840) (← links)
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights (Q3618576) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- Finding Optimal Solutions With Neighborly Help. (Q5092442) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- Reoptimization of NP-Hard Problems (Q6163646) (← links)