Adjacency of vertices of the complete pre-order polytope
From MaRDI portal
(Redirected from Publication:1377754)
Recommendations
Cites work
- Graph theory
- scientific article; zbMATH DE number 3904331 (Why is no real title available?)
- scientific article; zbMATH DE number 3659595 (Why is no real title available?)
- scientific article; zbMATH DE number 3687081 (Why is no real title available?)
- scientific article; zbMATH DE number 36207 (Why is no real title available?)
- Parallel concepts in graph theory
- Polytopes, graphs, and complexes
- The adjacency relation on the traveling salesman polytope is NP-Complete
- The travelling salesman problem and a class of polyhedra of diameter two
Cited in
(6)- Weak order polytopes.
- Adjacency on the order polytope with applications to the theory of fuzzy measures
- Multiprocessor scheduling under precedence constraints: polyhedral results
- Polyhedral aspects of partial orders and comparability graphs
- Determining adjacent vertices on assignment polytopes
- Adjacencies on random ordering polytopes and flow polytopes
This page was built for publication: Adjacency of vertices of the complete pre-order polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377754)