On affine reducibility of combinatorial polytopes
type: Item
instance of: scholarly article
title: On affine reducibility of combinatorial polytopes
zbMATH Open document ID: 1262.90148
DOI: 10.1134/S1064562412020123
author: Aleksandr N. Maksimenko
published in: Doklady Mathematics
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6106442
zbMATH Keywords: nonadjacency
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
cites work: Q3882177
cites work: The adjacency relation on the traveling salesman polytope is NP-Complete
cites work: Adjacency on the constrained assignment problem
cites work: A combinatorial study of partial order polytopes
Recommended article: On combinatorial and affine automorphisms of polytopes
Recommended article: On the Facets of Combinatorial Polytopes
Recommended article: Reducibility of hyperplane arrangements
Recommended article: Q4309961
Recommended article: Q5288967
Recommended article: On reduced polytopes and antipodality
Recommended article: Q5286194
Recommended article: Q4274011
Recommended article: On the combinatorial complexity of approximating polytopes
Recommended article: Q3132844
description: scientific article; zbMATH DE number 6106442