On Residual Approximation in Solution Extension Problems - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2016

On Residual Approximation in Solution Extension Problems

Abstract

The solution extension variant of a problem consists in, being given an instance and a partial solution, finding the best solution comprising the given partial solution. Many problems have been studied with a similar approach. For instance the Precoloring Extension problem, the clustered variant of the Travelling Salesman problem, or the General Routing Problem are in a way typical examples of solution extension variant problems. Motivated by practical applications of such variants, this work aims to explore different aspects around extension on classical optimization problems. We define residue-approximations as algorithms whose performance ratio on the non-prescribed part can be bounded, and corresponding complexity classes. Using residue-approximation, we classify several problems according to their residue-approximability.
No file

Dates and versions

lirmm-01378581 , version 1 (10-10-2016)

Identifiers

Cite

Mathias Weller, Annie Chateau, Rodolphe Giroudeau, Jean-Claude König, Valentin Pollet. On Residual Approximation in Solution Extension Problems. COCOA: Conference on Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.463-476, ⟨10.1007/978-3-319-48749-6_34⟩. ⟨lirmm-01378581⟩
203 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More