On inverse traveling salesman problems

DOI10.1007/S10288-011-0194-4MaRDI QIDQ1936660zbMATH OpenOpenAlexFDO

Authors Yerim Chung, Marc Demange

Publication date 6 February 2013

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-011-0194-4

zbMATH Keywords

computational complexityinverse problemapproximation ratiotraveling salesman problems2-opt heuristic

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Some 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
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance

Cites work

• scientific article; zbMATH DE number 5823945 (Why is no real title available?)
• scientific article; zbMATH DE number 46855 (Why is no real title available?)
• scientific article; zbMATH DE number 3576997 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• A Faster Algorithm for the Inverse Spanning Tree Problem
• A breviary of seismic tomography. Imaging the interior of the earth and sun
• A general model of some inverse combinatorial optimization problems and its solution method under \(\ell_\infty\) norm
• A tutorial on the use of graph coloring for some problems in robotics
• Algorithms in order restricted statistical inference and the Cauchy mean value property
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• An inverse problem of the weighted shortest path problem
• Automata, Languages and Programming
• Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
• Inverse Optimization
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse minimum flow problem
• Isotonic Median Regression: A Linear Programming Approach
• On Syntactic versus Computational Views of Approximability
• On an instance of the inverse shortest paths problem
• On the hardness of approximating minimum vertex cover
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• The 0-1 inverse maximum stable set problem
• The complexity analysis of the inverse center location problem
• Weighted isotonic regression under the L₁ norm

Cited in

(7)

• The \(0-1\) inverse maximum independent set problem on forests and unicyclic graphs
• The inverse connected \(p\)-median problem on block graphs under various cost functions
• The analyst's traveling salesman theorem in graph inverse limits
• Inverse chromatic number problems in interval and permutation graphs
• Some Inverse Traveling Salesman Problems
• Method to solve the travelling salesman problem using the inverse of diffusion process
• Notes on inverse bin-packing problems

This page was built for publication: On inverse traveling salesman problems

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