Pages that link to "Item:Q1069451"
From MaRDI portal
The following pages link to A note on finding a shortest complete cycle in an undirected graph (Q1069451):
Displaying 3 items.
- Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph (Q289795) (← links)
- 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)