On the skeleton of the polytope of pyramidal tours

DOI10.1134/S1990478918010027zbMATH Open1413.05074WikidataQ130185411 ScholiaQ130185411MaRDI QIDQ4553641FDOQ4553641

Andrei Nikolaev, V. A. Bondarenko

Publication date: 30 October 2018

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

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

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)

Cites Work

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

Cited In (7)

• 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
• On potential theoretic skeletons of polyhedra
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
• Some properties of the skeleton of the pyramidal tours polytope
• Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph

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)