Pages that link to "Item:Q3885528"
From MaRDI portal
The following pages link to Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem (Q3885528):
Displaying 9 items.
- On dual solutions of the linear assignment problem (Q761971) (← links)
- An improved assignment lower bound for the Euclidean traveling salesman problem (Q1058993) (← links)
- Solving symmetric vehicle routing problems asymmetrically (Q1171005) (← links)
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- Improving Christofides' lower bound for the traveling salesman problem (Q3698662) (← links)
- Better assignment lower bounds for the Euclidean traveling salesman problem (Q3771999) (← links)
- A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
- Lower bounds for symmetric<i>K</i>-peripatetic salesman problems (Q5749147) (← links)
