Pages that link to "Item:Q1744982"
From MaRDI portal
The following pages link to Approximation schemes for the generalized traveling salesman problem (Q1744982):
Displaying 7 items.
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- Dynamic programming in the routing problem: decomposition variant (Q5097703) (← links)
- The reduction of the Pareto set of a special structure in bicriteria discrete problems (Q5100140) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← 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)
- Multi-candidate carpooling routing problem and its approximation algorithms (Q6606200) (← links)
