Pages that link to "Item:Q1291588"
From MaRDI portal
The following pages link to Estimating the Held-Karp lower bound for the geometric TSP (Q1291588):
Displaying 14 items.
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
- A new lower bound for the geometric traveling salesman problem in terms of discrepancy (Q991472) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- The cardinality constrained covering traveling salesman problem (Q1869889) (← links)
- Fairness in ambulance routing for post disaster management (Q2089315) (← links)
- Efficient optimization of the Held-Karp lower bound (Q2165584) (← links)
- Method of scaling in approximate solution of the traveling salesman problem (Q2392635) (← links)
- A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
- Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem (Q3360680) (← links)
- (Q4875205) (← links)
- New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
- The daily swab test collection problem (Q6547116) (← links)
