| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652653 | Electronic Notes in Discrete Mathematics | 2008 | 6 Pages |
Abstract
Usual inverse combinatorial optimization problems consist in modifying as little as possible the instance parameters to make a given solution optimal. In this paper we consider several extensions taking into account constraints on the weight system and inverse problems against a specific algorithm. We consider TSP under this point of view and devise both complexity and approximation results.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
