Pages that link to "Item:Q2294592"
From MaRDI portal
The following pages link to Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592):
Displaying 3 items.
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- Parameter tuning of continuous Hopfield network applied to combinatorial optimization (Q6496420) (← links)
