Pages that link to "Item:Q4153924"

The following pages link to The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924):

Displaying 33 items.

• Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
• Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
• On the polytope of non-additive measures (Q835202) (← links)
• On the structure of the \(k\)-additive fuzzy measures (Q991415) (← links)
• On minimal Eulerian graphs (Q1162523) (← links)
• Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
• Faces with large diameter on the symmetric traveling salesman polytope (Q1200768) (← links)
• Adjacency on the constrained assignment problem (Q1270787) (← links)
• The monotonic diameter of traveling salesman polytopes (Q1271383) (← links)
• Some graphic uses of an even number of odd nodes (Q1296145) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• Adjacency of vertices of the complete pre-order polytope (Q1377754) (← links)
• Interchange graphs and the Hamiltonian cycle polytope (Q1382266) (← links)
• Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
• Some properties of the skeleton of the pyramidal tours polytope (Q1689899) (← links)
• On affine reducibility of combinatorial polytopes (Q1761001) (← links)
• The skeleton of the symmetric Traveling Salesman Polytope (Q1801669) (← links)
• On \({\mathbb{K}}^{\Delta}\) (Q1821691) (← links)
• Adjacency on combinatorial polyhedra (Q1842660) (← links)
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
• The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
• Adjacency on the order polytope with applications to the theory of fuzzy measures (Q2270242) (← links)
• A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups (Q2460490) (← links)
• On pedigree polytopes and Hamiltonian cycles (Q2497514) (← links)
• The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Extended Abstract) (Q2971660) (← links)
• Adjacency on polymatroids (Q3335528) (← links)
• On the facets and diameter of the<b><i>k</i></b>-cycle polytope (Q3426327) (← links)
• On Pedigree Polytopes and Hamiltonian Cycles (Q3439015) (← links)
• Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)
• On the Skeleton of the Polytope of Pyramidal Tours (Q4553641) (← links)
• Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
• Flip distances between graph orientations (Q5919075) (← links)