The following pages link to Aleksandr N. Maksimenko (Q1741476):
Displayed 18 items.
- On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation (Q1741477) (← links)
- An analog of the Cook theorem for polytopes (Q1759309) (← links)
- On affine reducibility of combinatorial polytopes (Q1761001) (← links)
- Item:Q1741476 (redirect page) (← links)
- Small extended formulations for cyclic polytopes (Q2351019) (← links)
- The simplest families of polytopes associated with NP-hard problems (Q2353062) (← links)
- Boolean quadric polytopes are faces of linear ordering polytopes (Q2403680) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- (Q3115270) (← links)
- Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm (Q5060054) (← links)
- Traveling salesman polytopes and cut polytopes. Affine reducibility (Q5249787) (← links)
- (Q5691934) (← links)
- Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes (Q5865703) (← links)
- A special role of Boolean quadratic polytopes among other combinatorial polytopes (Q6253687) (← links)
- The lower bound for the number of facets of a k-neighborly d-polytope with d+3 vertices (Q6265059) (← links)
- On the minimum number of facets of a 2-neighborly polytope (Q6305954) (← links)
- 2-neighborly 0/1-polytopes of dimension 7 (Q6316823) (← links)
- All 2-neighborly d-polytopes with at most d + 9 facets (Q6330722) (← links)