The following pages link to On the Hardness of Reoptimization (Q5448637):
Displaying 30 items.
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Fast reoptimization for the minimum spanning tree problem (Q988691) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← 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)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- Reoptimization of Steiner Trees (Q3512464) (← 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)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- (Q5002685) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)
- Finding optimal solutions with neighborly help (Q6547211) (← links)
- Heuristic reoptimization of time-extended multi-robot task allocation problems (Q6566561) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)
