On the skeleton of the polytope of pyramidal tours

DOI10.1134/S1990478918010027MaRDI QIDQ4553641zbMATHWikidataFDO

Authors V. A. Bondarenko, Andrei Nikolaev

Publication date 30 October 2018

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

clique numbergraph diameter1-skeletonpyramidal tournecessary and sufficient condition of adjacency

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Recommendations

• Some properties of the skeleton of the pyramidal tours polytope
• On vertex adjacencies in the polytope of pyramidal tours with step-backs
• The skeleton of the symmetric Traveling Salesman Polytope
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
• Pyramidal tours and the traveling salesman problem

Cites work

• scientific article; zbMATH DE number 3943559 (Why is no real title available?)
• scientific article; zbMATH DE number 4027206 (Why is no real title available?)
• scientific article; zbMATH DE number 3371832 (Why is no real title available?)
• A Bound of 4 for the Diameter of the Symmetric Traveling Salesman Polytope
• Adjacency of the 0-1 knapsack problem
• Faces of diameter two on the Hamiltonian cycle polytope
• Faces with large diameter on the symmetric traveling salesman polytope
• Four-point conditions for the TSP: the complete complexity classification
• Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
• On graphs of the cone decompositions for the min-cut and max-cut problems
• On the facets and diameter of thek-cycle polytope
• Solution of a Large-Scale Traveling-Salesman Problem
• Some properties of the skeleton of the pyramidal tours polytope
• The adjacency relation on the traveling salesman polytope is NP-Complete
• The skeleton of the symmetric Traveling Salesman Polytope
• The traveling salesman problem. A computational study.
• The travelling salesman problem and a class of polyhedra of diameter two
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey

Cited in

(10)

• Some properties of the skeleton of the pyramidal tours polytope
• On vertex adjacencies in the polytope of pyramidal tours with step-backs
• Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search
• On 1-skeleton of the polytope of pyramidal tours with step-backs
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
• Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
• On potential theoretic skeletons of polyhedra
• The skeleton of the symmetric Traveling Salesman Polytope
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming

This page was built for publication: On the skeleton of the polytope of pyramidal tours

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