Aleksandr N. Maksimenko

Available identifiers

Publication	Date of Publication	Type
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm	2023-01-17	Paper
Affine maps between quadratic assignment polytopes and subgraph isomorphism polytopes	2022-06-09	Paper
All 2-neighborly d-polytopes with at most d + 9 facets	2019-12-09	Paper
On a family of \(0/1\)-polytopes with an NP-complete criterion for vertex nonadjacency relation	2019-05-03	Paper
2-neighborly 0/1-polytopes of dimension 7	2019-04-07	Paper
On the minimum number of facets of a 2-neighborly polytope	2018-08-29	Paper
Boolean quadric polytopes are faces of linear ordering polytopes	2017-09-11	Paper
Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes	2017-02-09	Paper
The lower bound for the number of facets of a k-neighborly d-polytope with d+3 vertices	2015-09-01	Paper
The simplest families of polytopes associated with NP-hard problems	2015-07-07	Paper
Small extended formulations for cyclic polytopes	2015-06-26	Paper
Traveling salesman polytopes and cut polytopes. Affine reducibility	2015-05-12	Paper
A special role of Boolean quadratic polytopes among other combinatorial polytopes	2014-08-05	Paper
An analog of the Cook theorem for polytopes	2012-11-20	Paper
On affine reducibility of combinatorial polytopes	2012-11-15	Paper
https://portal.mardi4nfdi.de/entity/Q3115270	2012-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q5691934	2005-09-27	Paper

This page was built for person: Aleksandr N. Maksimenko