Pages that link to "Item:Q6112583"
From MaRDI portal
The following pages link to Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583):
Displaying 7 items.
- PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem (Q2679785) (← links)
- On extended formulations for the precedence constrained asymmetric traveling salesman problem (Q5487814) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests (Q6194920) (← 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)