A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups
From MaRDI portal
Publication:2460490
Recommendations
- scientific article; zbMATH DE number 848091
- scientific article; zbMATH DE number 2168903
- Adjacency on the constrained assignment problem
- Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
- Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope
Cites work
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
- Adjacent vertices of the all 0-1 programming polytope
- Conditions for the strong solvability of optimization problems on permutations and their application.
- Decomposition of graphs on surfaces and a homotopic circulation theorem
- scientific article; zbMATH DE number 3898613 (Why is no real title available?)
- scientific article; zbMATH DE number 4108497 (Why is no real title available?)
- scientific article; zbMATH DE number 3687081 (Why is no real title available?)
- scientific article; zbMATH DE number 3695387 (Why is no real title available?)
- Neighbor relations on the convex of cyclic permutations
- On the Tours of a Traveling Salesman
- The adjacency relation on the traveling salesman polytope is NP-Complete
- The traveling salesman problem and its variations
- The travelling salesman problem and a class of polyhedra of diameter two
Cited in
(3)
This page was built for publication: A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2460490)