Some Inverse Traveling Salesman Problems

Yerim Chung, Marc Demange

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)9-14
Number of pages6
JournalElectronic Notes in Discrete Mathematics
Issue numberC
Publication statusPublished - 2008 Feb 20

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Some Inverse Traveling Salesman Problems'. Together they form a unique fingerprint.

Cite this