Pages that link to "Item:Q6163646"
From MaRDI portal
The following pages link to Reoptimization of NP-Hard Problems (Q6163646):
Displaying 12 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 max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization (Q2312327) (← links)
- Reoptimization in machine scheduling (Q2453159) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Complexity and approximation in reoptimization (Q2906564) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)