Pages that link to "Item:Q5277951"
From MaRDI portal
The following pages link to Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951):
Displayed 6 items.
- 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)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition (Q5104667) (← links)
- An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem (Q6142940) (← links)
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems (Q6180041) (← links)