The following pages link to (Q3079180):
Displaying 25 items.
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- Reoptimization in machine scheduling (Q2453159) (← 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 Traveling Salesperson Problems: Changing Single Edge-Weights (Q3618576) (← links)
- Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems (Q4609785) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- Fine-grained Complexity Analysis of Two Classic TSP Variants (Q5028342) (← links)
- Approximation Polynomial Algorithms for Some Modifications of TSP (Q5392089) (← links)
- On the Hardness of Reoptimization (Q5448637) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- Heuristic reoptimization of time-extended multi-robot task allocation problems (Q6566561) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)
