Pages that link to "Item:Q2906564"
From MaRDI portal
The following pages link to Complexity and approximation in reoptimization (Q2906564):
Displaying 25 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)
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← 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)
- The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← 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)
- Reoptimization in machine scheduling (Q2453159) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On the Hardness of Reoptimization with Multiple Given Solutions (Q3100925) (← links)
- On accuracy and efficiency of constrained reinitialization (Q3579858) (← links)
- New algorithms for Steiner tree reoptimization (Q5002685) (← 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)
- The MIP workshop 2023 computational competition on reoptimization (Q6590466) (← links)
- Progressively strengthening and tuning MIP solvers for reoptimization (Q6590467) (← links)