Pages that link to "Item:Q4943841"
From MaRDI portal
The following pages link to The Angular-Metric Traveling Salesman Problem (Q4943841):
Displaying 25 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Going around in circles (Q419506) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- Linear models and computational experiments for the quadratic TSP (Q510950) (← links)
- Peeling meshed potatoes (Q534778) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- 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)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- Angle-restricted tours in the plane. (Q2482907) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- A Polyhedral Study of the Quadratic Traveling Salesman Problem (Q2806910) (← links)
- Minimum Scan Cover with Angular Transition Costs (Q4997133) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- (Q6124757) (← links)
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems (Q6180041) (← links)
- Acute tours in the plane (Q6624171) (← links)
- What goes around comes around: covering tours and cycle covers with turn costs (Q6635695) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)