Pages that link to "Item:Q2867366"
From MaRDI portal
The following pages link to Simple and fast reoptimizations for the Steiner tree problem (Q2867366):
Displaying 25 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)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← 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)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Reoptimization of set covering problems (Q2247803) (← links)
- Reoptimization of the metric deadline TSP (Q2266941) (← links)
- Reoptimization in machine scheduling (Q2453159) (← links)
- Reactive tabu search with path-relinking for the Steiner problem in graphs (Q2776545) (← 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)
- Reoptimization of Steiner Trees (Q3512464) (← links)
- Reoptimization of the Metric Deadline TSP (Q3599123) (← links)
- Analysis and Experimental Study of Heuristics for Job Scheduling Reoptimization Problems (Q4609785) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)