The following pages link to (Q2906564):
Displaying 13 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 constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- Reallocation problems in scheduling (Q747625) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization (Q2312327) (← links)
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications (Q2420657) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- (Q5002685) (← links)
