Pages that link to "Item:Q1984690"
From MaRDI portal
The following pages link to Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690):
Displaying 6 items.
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← 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)
