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 5 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)
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (Q6588151) (← links)
- Reliable production process design problem: compact MILP model and ALNS-based primal heuristic (Q6588744) (← links)
