Some Inverse Traveling Salesman Problems

DOI10.1016/J.ENDM.2008.01.003MaRDI QIDQ3503524zbMATH OpenOpenAlexFDO

Authors Yerim Chung, Marc Demange

Publication date 5 June 2008

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.01.003

zbMATH Keywords

2optinverse combinatorial optimizationTSPTSP\(_{\{1, 2\}}\)

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On inverse traveling salesman problems
• On one approach to TSP structural stability
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Some inverse optimization problems under the Hamming distance
• Reoptimization of Minimum and Maximum Traveling Salesman’s Tours

Cites work

• A better approximation ratio for the vertex cover problem
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• Integer Isotone Optimization
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse Optimization
• On inverse chromatic number problems (extended abstract)
• The 0-1 inverse maximum stable set problem
• The complexity analysis of the inverse center location problem

Cited in

(5)

• Method to solve the travelling salesman problem using the inverse of diffusion process
• On inverse traveling salesman problems
• The 0-1 inverse maximum independent set problem on forests and unicyclic graphs
• The analyst's traveling salesman theorem in graph inverse limits
• Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs

This page was built for publication: Some Inverse Traveling Salesman Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503524)