Pages that link to "Item:Q1069451"

The following pages link to A note on finding a shortest complete cycle in an undirected graph (Q1069451):

Displaying 2 items.

• A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)