Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
type: Item
instance of: scholarly article
title: Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope
zbMATH Open document ID: 1474.90290
author: Y. Aharonov
published in: Discrete Optimization
publication date: 2018-08-17T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6920192
zbMATH Keywords: pedigree polytope
zbMATH Keywords: symmetric traveling salesman problem
zbMATH Keywords: nonadjacency testing
zbMATH Keywords: multistage insertion formulation
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: j.disopt.2013.07.001
OpenAlex ID: W2086332879
cites work: Q4382664
cites work: Q5187226
cites work: Q4398370
cites work: The traveling salesman problem and its variations
cites work: Q3425132
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Q4198056
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
cites work: Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: An alternate formulation of the symmetric traveling salesman problem and its properties
cites work: On the equivalence of the multistage-insertion and cycle-shrink formulations of the symmetric traveling salesman problem
cites work: On pedigree polytopes and Hamiltonian cycles
cites work: On the Membership Problem of the Pedigree Polytope
cites work: Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration
cites work: Hamiltonicity and combinatorial polyhedra
cites work: Adjacency of the best and second best valued solutions in combinatorial optimization problems
cites work: Adjacency on combinatorial polyhedra
cites work: An analytical comparison of different formulations of the travelling salesman problem
cites work: A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
cites work: Classification of travelling salesman problem formulations
cites work: Q4461904
cites work: The adjacency relation on the traveling salesman polytope is NP-Complete
cites work: On the Tours of a Traveling Salesman
cites work: Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
DOI: 10.1016/J.DISOPT.2013.07.001
description: scientific article; zbMATH DE number 6920192