Some Inverse Traveling Salesman Problems

Yerim Chung; Marc Demange

doi:10.1016/j.endm.2008.01.003

Some Inverse Traveling Salesman Problems

Yerim Chung, Marc Demange

Department of Business Administration

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

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.

Original language	English
Pages (from-to)	9-14
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	30
Issue number	C
DOIs	https://doi.org/10.1016/j.endm.2008.01.003
Publication status	Published - 2008 Feb 20

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.endm.2008.01.003

Cite this

@article{50fc4061ffb24197bfcf5becd8c3387e,

title = "Some Inverse Traveling Salesman Problems",

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.",

author = "Yerim Chung and Marc Demange",

year = "2008",

month = feb,

day = "20",

doi = "10.1016/j.endm.2008.01.003",

language = "English",

volume = "30",

pages = "9--14",

journal = "Electronic Notes in Discrete Mathematics",

issn = "1571-0653",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Some Inverse Traveling Salesman Problems

AU - Chung, Yerim

AU - Demange, Marc

PY - 2008/2/20

Y1 - 2008/2/20

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=39149089278&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=39149089278&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2008.01.003

DO - 10.1016/j.endm.2008.01.003

M3 - Article

AN - SCOPUS:39149089278

SN - 1571-0653

VL - 30

SP - 9

EP - 14

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

IS - C

ER -

Some Inverse Traveling Salesman Problems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this