Combinatorial structure and adjacency of vertices of polytope of b-factors
From MaRDI portal
Publication:2262901
Recommendations
Cites work
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
- Facet identification for the symmetric traveling salesman polytope
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3687081 (Why is no real title available?)
- scientific article; zbMATH DE number 1285729 (Why is no real title available?)
- On affine reducibility of combinatorial polytopes
- On non-integer vertices of the polytope of the three-index axial assignment problem
- Solution of large-scale symmetric travelling salesman problems
- The travelling salesman problem and a class of polyhedra of diameter two
Cited in
(4)- A combinatorial proof of a formula for Betti numbers of a stacked polytope
- A criterion for the adjacency of vertices of polytopes generated by subsets of symmetric groups
- scientific article; zbMATH DE number 1285729 (Why is no real title available?)
- scientific article; zbMATH DE number 1397185 (Why is no real title available?)
This page was built for publication: Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2262901)