The neighborhood-tour conjecture for ASEP vertices
Statement
Let be the asymmetric subtour elimination polytope, let be a vertex of this polytope, and let denote its neighborhood in the vertex structure considered by the paper. A tour is a Hamiltonian cycle of the complete directed graph on the node set. Neighborhood-tour conjecture. For every vertex , the neighborhood contains at least one tour. This is presented as a conjecture based on preliminary computational tests; the supplied text does not establish it or indicate a resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.