Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors
From MaRDI portal
Publication:2262901
DOI10.3103/S1066369X14060061zbMath1308.90154MaRDI QIDQ2262901
Publication date: 17 March 2015
Published in: Russian Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)
Cites Work
- Solution of large-scale symmetric travelling salesman problems
- Facet identification for the symmetric traveling salesman polytope
- On affine reducibility of combinatorial polytopes
- The travelling salesman problem and a class of polyhedra of diameter two
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
- On non-integer vertices of the polytope of the three-index axial assignment problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial structure and adjacency of vertices of polytope of \(b\)-factors