The following pages link to Andrei Nikolaev (Q1689898):
Displaying 17 items.
- (Q393847) (redirect page) (← links)
- Combinatorial and geometric properties of the max-cut and min-cut problems (Q393848) (← links)
- A class of hypergraphs and vertices of cut polytope relaxations (Q416923) (← links)
- Some properties of the skeleton of the pyramidal tours polytope (Q1689899) (← links)
- On graphs of the cone decompositions for the min-cut and max-cut problems (Q1751487) (← links)
- On vertex adjacencies in the polytope of pyramidal tours with step-backs (Q2181763) (← links)
- Simulated annealing approach to verify vertex adjacencies in the traveling salesperson polytope (Q2181774) (← links)
- Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
- On a recognition problem on cut polytope relaxations (Q2261801) (← links)
- On Integer Recognition over Some Boolean Quadric Polytope Extension (Q3133214) (← links)
- On the Skeleton of the Polytope of Pyramidal Tours (Q4553641) (← links)
- Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
- On 1-skeleton of the polytope of pyramidal tours with step-backs (Q6390344) (← links)
- On cone partitions for the min-cut and max-cut problems with non-negative edges (Q6508735) (← links)
- On 1-skeleton of the cut polytopes (Q6522748) (← links)
- On 1-skeleton of the polytope of pyramidal tours with step-backs (Q6642671) (← links)
- Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)
