Pages that link to "Item:Q386899"
From MaRDI portal
The following pages link to Reoptimization of maximum weight induced hereditary subgraph problems (Q386899):
Displaying 9 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)
- 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)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Reoptimization under vertex insertion: max \(P_{k}\)-free subgraph and max planar subgraph (Q2846477) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)