Some Inverse Traveling Salesman Problems

@article{citeulike:2500796, 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 = {Chung, Yerim and Demange, Marc }, booktitle = {The IV Latin-American Algorithms, Graphs, and Optimization Symposium, The IV Latin-American Algorithms, Graphs, and Optimization Symposium}, citeulike-article-id = {2500796}, doi = {http://dx.doi.org/10.1016/j.endm.2008.01.003}, journal = {Electronic Notes in Discrete Mathematics}, keywords = {algorithms, graph, optimization}, month = {February}, pages = {9--14}, posted-at = {2008-03-10 13:48:52}, priority = {2}, title = {Some Inverse Traveling Salesman Problems}, url = {http://dx.doi.org/10.1016/j.endm.2008.01.003}, volume = {30}, year = {2008} }

TY - JOUR ID - citeulike:2500796 L3 - citeulike-article-id:2500796 TI - Some Inverse Traveling Salesman Problems T2 - The IV Latin-American Algorithms, Graphs, and Optimization Symposium, The IV Latin-American Algorithms, Graphs, and Optimization Symposium JF - Electronic Notes in Discrete Mathematics VL - 30 SP - 9 EP - 14 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. KW - algorithms KW - graph KW - optimization AU - Chung, Yerim AU - Demange, Marc PY - 2008/02/20/ UR - http://dx.doi.org/10.1016/j.endm.2008.01.003 ER -