Sensitivity analysis for symmetric 2-peripatetic salesman problems
From MaRDI portal
Publication:2367396
DOI10.1016/0167-6377(93)90033-DzbMATH Open0771.90093OpenAlexW1988228774MaRDI QIDQ2367396FDOQ2367396
Authors: Jeroen B. J. M. De Kort 
Publication date: 10 August 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(93)90033-d
Recommendations
- Bounds for the symmetric 2-peripatetic salesman problem
- scientific article; zbMATH DE number 89094
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
- On the generalized 2-peripatetic salesman problem
- Approximating the metric 2-peripatetic salesman problem
- Approximation algorithms for the maximum 2-peripatetic salesman problem
- Sensitivity Analysis in Minisum Facility Location Problems
- Lower bounds for symmetricK-peripatetic salesman problems
- A 2-approximation algorithm for the metric 2-peripatetic salesman problem
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Title not available (Why is that?)
- Minimum partition of a matroid into independent subsets
- Branch-and-Bound Methods: A Survey
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Title not available (Why is that?)
- Bounds for the symmetric 2-peripatetic salesman problem
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
- Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
Cited In (4)
This page was built for publication: Sensitivity analysis for symmetric 2-peripatetic salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367396)
