Pages that link to "Item:Q951094"
From MaRDI portal
The following pages link to Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094):
Displaying 5 items.
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (Q1611004) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities. (Q1611005) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)