Reoptimization of NP-Hard Problems

DOI10.1007/978-3-319-98355-4_28zbMath1514.68318OpenAlexW4243327565MaRDI QIDQ6163646

Anna Zych-Pawlewicz

Publication date: 30 June 2023

Published in: Adventures Between Lower Bounds and Higher Altitudes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-98355-4_28

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (5)

On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization in machine scheduling ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization

Cites Work

• Unnamed Item
• Unnamed Item
• Reoptimization of the shortest common superstring problem
• Reoptimization of Steiner trees: changing the terminal set
• Reoptimization of set covering problems
• Reoptimization of the metric deadline TSP
• New Reoptimization Techniques applied to Steiner Tree Problem
• Reoptimization of Steiner Trees
• The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality
• Reoptimization of Weighted Graph and Covering Problems
• Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
• Reoptimizing the traveling salesman problem
• Robust Reoptimization of Steiner Trees
• On the Hardness of Reoptimization
• Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
• Scheduling with forbidden sets

This page was built for publication: Reoptimization of NP-Hard Problems