Pages that link to "Item:Q2003422"
From MaRDI portal
The following pages link to Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422):
Displaying 8 items.
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Accelerating the calculation of makespan used in scheduling improvement heuristics (Q2668662) (← links)
- The Angular-Metric Traveling Salesman Problem (Q4943841) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- (Q6124757) (← links)
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems (Q6180041) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)