Pages that link to "Item:Q1061620"

The following pages link to Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms (Q1061620):

Displaying 7 items.

• Some properties of the skeleton of the pyramidal tours polytope (Q1689899) (← links)
• Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search (Q2230729) (← links)
• On the Skeleton of the Polytope of Pyramidal Tours (Q4553641) (← links)
• Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm (Q5060054) (← links)
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph (Q5870844) (← links)
• Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)
• Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming (Q6645186) (← links)