Pages that link to "Item:Q1956919"
From MaRDI portal
The following pages link to The symmetric travelling salesman problem. II: New low bounds (Q1956919):
Displaying 16 items.
- Fast algorithm to find 2-factor of minimum weight (Q334255) (← links)
- A note on symmetry reduction for circular traveling tournament problems (Q531484) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
- A note on dual solutions of the assignment problem in connection with the traveling salesman problem (Q911984) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- A study of the parameters of branch-and-bound algorithms for solving the symmetric traveling salesman problem (Q1281074) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- Branch-and-bound algorithm for Symmetric Travelling Salesman problem (Q1671016) (← links)
- Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data (Q1792597) (← links)
- Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- An Additive Bounding Procedure for Combinatorial Optimization Problems (Q3832317) (← links)
- An improved branching rule for the symmetric travelling salesman problem (Q4658394) (← links)
