Pages that link to "Item:Q1058993"
From MaRDI portal
The following pages link to An improved assignment lower bound for the Euclidean traveling salesman problem (Q1058993):
Displaying 5 items.
- A new lower bound for the geometric traveling salesman problem in terms of discrepancy (Q991472) (← links)
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← 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)