Pages that link to "Item:Q2907959"
From MaRDI portal
The following pages link to A survey on combinatorial optimization in dynamic environments (Q2907959):
Displaying 10 items.
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions (Q334238) (← links)
- A note on the traveling salesman reoptimization problem under vertex insertion (Q483055) (← links)
- Evolutionary and population-based methods versus constructive search strategies in dynamic combinatorial optimization (Q780956) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← 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)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- Optimal online algorithms for the portfolio selection problem, bi-directional trading and -search with interrelated prices (Q5242357) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)