scientific article
From MaRDI portal
Publication:2906564
zbMath1262.90172MaRDI QIDQ2906564
Bruno Escoffier, Vincenzo Bonifaci, Giorgio Ausiello
Publication date: 5 September 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (14)
A survey on combinatorial optimization in dynamic environments ⋮ Hardness of reoptimization of the problem of calculating the chromatic number of a graph with a given set of optimal solutions ⋮ On Lagrangian relaxation for constrained maximization and reoptimization problems ⋮ Reoptimization of constraint satisfaction problems with approximation resistant predicates ⋮ Robust reoptimization of Steiner trees ⋮ Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications ⋮ Reoptimization of NP-Hard Problems ⋮ Unnamed Item ⋮ A theory and algorithms for combinatorial reoptimization ⋮ Reoptimization of max \(k\)-cover: approximation ratio threshold ⋮ Exact lexicographic scheduling and approximate rescheduling ⋮ Reallocation problems in scheduling ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ Reoptimization of minimum and maximum traveling salesman's tours
This page was built for publication:
