A Theory and Algorithms for Combinatorial Reoptimization

DOI10.1007/978-3-642-29344-3_52zbMath1354.90115OpenAlexW1528796068MaRDI QIDQ2894503

Gal Tamir, Tami Tamir, Hadas Shachnai

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_52

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (8)

Reoptimization of parameterized problems ⋮ On the parameterized complexity of dynamic problems ⋮ Fixing improper colorings of graphs ⋮ A theory and algorithms for combinatorial reoptimization ⋮ A note on the traveling salesman reoptimization problem under vertex insertion ⋮ Reallocation problems in scheduling ⋮ A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization ⋮ Introduction to reconfiguration

This page was built for publication: A Theory and Algorithms for Combinatorial Reoptimization