Complexity and approximation in reoptimization
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(29)- Reoptimization of minimum and maximum traveling salesman's tours
- A theory and algorithms for combinatorial reoptimization
- The complexity of approximation reoptimization algorithms for discrete optimization
- Improving the complexities of approximation algorithms for optimization problems
- Exact lexicographic scheduling and approximate rescheduling
- Robust reoptimization of Steiner trees
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Reoptimization in machine scheduling
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- A theory and algorithms for combinatorial reoptimization
- A survey on combinatorial optimization in dynamic environments
- Knowing all optimal solutions does not help for TSP reoptimization
- On the Hardness of Reoptimization with Multiple Given Solutions
- Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions
- On accuracy and efficiency of constrained reinitialization
- Reoptimization of constraint satisfaction problems with approximation resistant predicates
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems
- Reoptimization of max \(k\)-cover: approximation ratio threshold
- New algorithms for Steiner tree reoptimization
- Reoptimizing the 0-1 knapsack problem
- Reoptimization of NP-Hard Problems
- Learning to repeatedly solve routing problems
- Heuristic reoptimization of time-extended multi-robot task allocation problems
- New algorithms for Steiner tree reoptimization
- The MIP workshop 2023 computational competition on reoptimization
- Progressively strengthening and tuning MIP solvers for reoptimization
- A generalized matching reconfiguration problem
- Reallocation problems in scheduling
This page was built for publication: Complexity and approximation in reoptimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906564)
