Pages that link to "Item:Q2266941"
From MaRDI portal
The following pages link to Reoptimization of the metric deadline TSP (Q2266941):
Displaying 17 items.
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- Reoptimization of maximum weight induced hereditary subgraph problems (Q386899) (← links)
- Approximation hardness of deadline-TSP reoptimization (Q1019743) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Robust reoptimization of Steiner trees (Q2182095) (← links)
- Reoptimization in machine scheduling (Q2453159) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← 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)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← links)
- (Q5077804) (← links)
- Deadline TSP (Q5925174) (← links)
- Stability of Reapproximation Algorithms for the $$\beta $$-Metric Traveling Salesman (Path) Problem (Q6163623) (← links)
- Reoptimization of NP-Hard Problems (Q6163646) (← links)
- Heuristic reoptimization of time-extended multi-robot task allocation problems (Q6566561) (← links)
- New algorithms for Steiner tree reoptimization (Q6586666) (← links)