The following pages link to (Q4461904):
Displaying 17 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem (Q410535) (← links)
- A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone (Q708346) (← links)
- A minimum spanning tree based heuristic for the travelling salesman tour (Q724377) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope (Q1662101) (← links)
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- Branching rules revisited (Q1886796) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity (Q5117306) (← links)
