Pages that link to "Item:Q594774"
From MaRDI portal
The following pages link to Distance conserving reductions for nonoriented networks (Q594774):
Displaying 4 items.
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
